java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 10:58:51,195 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 10:58:51,197 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 10:58:51,208 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 10:58:51,209 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 10:58:51,210 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 10:58:51,211 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 10:58:51,213 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 10:58:51,215 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 10:58:51,215 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 10:58:51,216 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 10:58:51,217 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 10:58:51,218 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 10:58:51,219 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 10:58:51,220 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 10:58:51,221 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 10:58:51,221 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 10:58:51,222 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 10:58:51,224 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 10:58:51,226 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 10:58:51,227 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 10:58:51,228 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 10:58:51,230 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 10:58:51,230 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 10:58:51,232 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 10:58:51,233 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 10:58:51,233 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 10:58:51,234 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 10:58:51,234 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 10:58:51,235 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 10:58:51,235 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 10:58:51,236 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 10:58:51,237 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 10:58:51,238 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 10:58:51,239 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 10:58:51,239 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 10:58:51,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 10:58:51,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 10:58:51,240 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 10:58:51,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 10:58:51,241 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 10:58:51,242 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-09-08 10:58:51,257 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 10:58:51,257 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 10:58:51,258 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 10:58:51,259 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 10:58:51,259 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 10:58:51,259 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 10:58:51,259 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 10:58:51,259 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 10:58:51,260 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 10:58:51,260 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 10:58:51,260 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 10:58:51,260 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 10:58:51,260 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 10:58:51,260 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 10:58:51,261 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 10:58:51,261 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 10:58:51,261 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 10:58:51,261 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 10:58:51,261 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 10:58:51,262 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 10:58:51,262 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 10:58:51,262 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:58:51,262 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 10:58:51,262 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 10:58:51,263 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 10:58:51,263 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 10:58:51,263 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 10:58:51,263 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 10:58:51,263 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 10:58:51,292 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 10:58:51,305 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 10:58:51,308 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 10:58:51,310 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 10:58:51,310 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 10:58:51,311 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 10:58:51,382 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d57bda561/63ad2234021a4f35af816c0d8f5cfb15/FLAG982ec72b7 [2019-09-08 10:58:52,236 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 10:58:52,239 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 10:58:52,303 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d57bda561/63ad2234021a4f35af816c0d8f5cfb15/FLAG982ec72b7 [2019-09-08 10:58:52,705 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d57bda561/63ad2234021a4f35af816c0d8f5cfb15 [2019-09-08 10:58:52,715 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 10:58:52,717 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 10:58:52,718 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 10:58:52,718 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 10:58:52,722 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 10:58:52,723 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:58:52" (1/1) ... [2019-09-08 10:58:52,726 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@324045ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:58:52, skipping insertion in model container [2019-09-08 10:58:52,726 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 10:58:52" (1/1) ... [2019-09-08 10:58:52,734 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 10:58:53,035 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 10:58:54,876 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:58:54,912 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 10:58:55,831 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 10:58:55,893 INFO L192 MainTranslator]: Completed translation [2019-09-08 10:58:55,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:58:55 WrapperNode [2019-09-08 10:58:55,894 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 10:58:55,896 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 10:58:55,896 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 10:58:55,896 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 10:58:55,913 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:58:55" (1/1) ... [2019-09-08 10:58:55,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:58:55" (1/1) ... [2019-09-08 10:58:56,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:58:55" (1/1) ... [2019-09-08 10:58:56,023 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:58:55" (1/1) ... [2019-09-08 10:58:56,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:58:55" (1/1) ... [2019-09-08 10:58:56,241 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:58:55" (1/1) ... [2019-09-08 10:58:56,285 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:58:55" (1/1) ... [2019-09-08 10:58:56,341 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 10:58:56,341 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 10:58:56,341 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 10:58:56,342 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 10:58:56,345 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:58:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 10:58:56,427 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 10:58:56,428 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 10:58:56,428 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 10:58:56,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 10:58:56,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 10:58:56,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 10:58:56,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uchar [2019-09-08 10:58:56,429 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 10:58:56,430 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 10:58:56,430 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 10:58:56,430 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 10:58:56,430 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 10:58:56,431 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 10:58:56,431 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 10:58:56,432 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 10:58:56,432 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 10:58:56,433 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 10:58:56,433 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 10:58:56,433 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 10:58:56,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 10:59:04,811 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 10:59:04,812 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 10:59:04,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:59:04 BoogieIcfgContainer [2019-09-08 10:59:04,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 10:59:04,816 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 10:59:04,816 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 10:59:04,820 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 10:59:04,820 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 10:58:52" (1/3) ... [2019-09-08 10:59:04,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f13a8f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:59:04, skipping insertion in model container [2019-09-08 10:59:04,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 10:58:55" (2/3) ... [2019-09-08 10:59:04,821 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f13a8f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 10:59:04, skipping insertion in model container [2019-09-08 10:59:04,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 10:59:04" (3/3) ... [2019-09-08 10:59:04,823 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_lcr-var-start-time.4.ufo.UNBOUNDED.pals.c.v+sep-reducer.c [2019-09-08 10:59:04,834 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 10:59:04,845 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2019-09-08 10:59:04,862 INFO L252 AbstractCegarLoop]: Starting to check reachability of 17 error locations. [2019-09-08 10:59:04,909 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 10:59:04,910 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 10:59:04,910 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 10:59:04,910 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 10:59:04,910 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 10:59:04,910 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 10:59:04,911 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 10:59:04,911 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 10:59:04,911 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 10:59:04,982 INFO L276 IsEmpty]: Start isEmpty. Operand 3537 states. [2019-09-08 10:59:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 10:59:05,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:05,019 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:59:05,022 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:05,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:05,031 INFO L82 PathProgramCache]: Analyzing trace with hash -1063639787, now seen corresponding path program 1 times [2019-09-08 10:59:05,034 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:05,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:05,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:05,124 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:05,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:05,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:05,828 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:59:05,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:05,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 10:59:05,836 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 10:59:05,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 10:59:05,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 10:59:05,853 INFO L87 Difference]: Start difference. First operand 3537 states. Second operand 5 states. [2019-09-08 10:59:11,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:11,536 INFO L93 Difference]: Finished difference Result 6633 states and 11828 transitions. [2019-09-08 10:59:11,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:59:11,540 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 68 [2019-09-08 10:59:11,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:11,613 INFO L225 Difference]: With dead ends: 6633 [2019-09-08 10:59:11,614 INFO L226 Difference]: Without dead ends: 4209 [2019-09-08 10:59:11,636 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-09-08 10:59:11,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4209 states. [2019-09-08 10:59:11,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4209 to 4185. [2019-09-08 10:59:11,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4185 states. [2019-09-08 10:59:11,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4185 states to 4185 states and 5586 transitions. [2019-09-08 10:59:11,998 INFO L78 Accepts]: Start accepts. Automaton has 4185 states and 5586 transitions. Word has length 68 [2019-09-08 10:59:11,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:11,999 INFO L475 AbstractCegarLoop]: Abstraction has 4185 states and 5586 transitions. [2019-09-08 10:59:12,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 10:59:12,000 INFO L276 IsEmpty]: Start isEmpty. Operand 4185 states and 5586 transitions. [2019-09-08 10:59:12,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:59:12,019 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:12,020 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:59:12,021 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:12,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:12,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1562022184, now seen corresponding path program 1 times [2019-09-08 10:59:12,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:12,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:12,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:12,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:12,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:12,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:59:12,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:12,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:59:12,422 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:59:12,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:59:12,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:59:12,422 INFO L87 Difference]: Start difference. First operand 4185 states and 5586 transitions. Second operand 6 states. [2019-09-08 10:59:15,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:15,991 INFO L93 Difference]: Finished difference Result 8578 states and 11551 transitions. [2019-09-08 10:59:15,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:59:15,991 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-08 10:59:15,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:16,022 INFO L225 Difference]: With dead ends: 8578 [2019-09-08 10:59:16,023 INFO L226 Difference]: Without dead ends: 5990 [2019-09-08 10:59:16,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:59:16,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5990 states. [2019-09-08 10:59:16,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5990 to 5949. [2019-09-08 10:59:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5949 states. [2019-09-08 10:59:16,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5949 states to 5949 states and 8054 transitions. [2019-09-08 10:59:16,275 INFO L78 Accepts]: Start accepts. Automaton has 5949 states and 8054 transitions. Word has length 69 [2019-09-08 10:59:16,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:16,276 INFO L475 AbstractCegarLoop]: Abstraction has 5949 states and 8054 transitions. [2019-09-08 10:59:16,276 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:59:16,276 INFO L276 IsEmpty]: Start isEmpty. Operand 5949 states and 8054 transitions. [2019-09-08 10:59:16,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 10:59:16,288 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:16,289 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:59:16,290 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:16,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:16,291 INFO L82 PathProgramCache]: Analyzing trace with hash 1710248159, now seen corresponding path program 1 times [2019-09-08 10:59:16,291 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:16,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:16,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:16,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:16,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:16,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:16,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:59:16,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:16,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:59:16,612 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:59:16,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:59:16,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:59:16,613 INFO L87 Difference]: Start difference. First operand 5949 states and 8054 transitions. Second operand 6 states. [2019-09-08 10:59:19,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:19,940 INFO L93 Difference]: Finished difference Result 13627 states and 18550 transitions. [2019-09-08 10:59:19,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:59:19,943 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 69 [2019-09-08 10:59:19,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:19,989 INFO L225 Difference]: With dead ends: 13627 [2019-09-08 10:59:19,990 INFO L226 Difference]: Without dead ends: 9003 [2019-09-08 10:59:20,014 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:59:20,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9003 states. [2019-09-08 10:59:20,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9003 to 8971. [2019-09-08 10:59:20,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8971 states. [2019-09-08 10:59:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8971 states to 8971 states and 12208 transitions. [2019-09-08 10:59:20,448 INFO L78 Accepts]: Start accepts. Automaton has 8971 states and 12208 transitions. Word has length 69 [2019-09-08 10:59:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:20,448 INFO L475 AbstractCegarLoop]: Abstraction has 8971 states and 12208 transitions. [2019-09-08 10:59:20,449 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:59:20,449 INFO L276 IsEmpty]: Start isEmpty. Operand 8971 states and 12208 transitions. [2019-09-08 10:59:20,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:59:20,459 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:20,460 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:59:20,460 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:20,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:20,461 INFO L82 PathProgramCache]: Analyzing trace with hash -20519424, now seen corresponding path program 1 times [2019-09-08 10:59:20,461 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:20,461 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:20,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:20,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:20,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:20,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:20,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:59:20,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:20,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 10:59:20,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 10:59:20,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 10:59:20,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:59:20,766 INFO L87 Difference]: Start difference. First operand 8971 states and 12208 transitions. Second operand 8 states. [2019-09-08 10:59:26,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:26,348 INFO L93 Difference]: Finished difference Result 15450 states and 22311 transitions. [2019-09-08 10:59:26,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 10:59:26,349 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 70 [2019-09-08 10:59:26,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:26,407 INFO L225 Difference]: With dead ends: 15450 [2019-09-08 10:59:26,408 INFO L226 Difference]: Without dead ends: 13921 [2019-09-08 10:59:26,416 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2019-09-08 10:59:26,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13921 states. [2019-09-08 10:59:26,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13921 to 8865. [2019-09-08 10:59:26,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8865 states. [2019-09-08 10:59:26,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8865 states to 8865 states and 12057 transitions. [2019-09-08 10:59:26,811 INFO L78 Accepts]: Start accepts. Automaton has 8865 states and 12057 transitions. Word has length 70 [2019-09-08 10:59:26,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:26,813 INFO L475 AbstractCegarLoop]: Abstraction has 8865 states and 12057 transitions. [2019-09-08 10:59:26,813 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 10:59:26,813 INFO L276 IsEmpty]: Start isEmpty. Operand 8865 states and 12057 transitions. [2019-09-08 10:59:26,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:59:26,829 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:26,829 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:59:26,830 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:26,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:26,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1266244003, now seen corresponding path program 1 times [2019-09-08 10:59:26,830 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:26,831 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:26,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:26,832 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:26,832 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:26,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:27,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:59:27,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:27,053 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 10:59:27,053 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 10:59:27,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 10:59:27,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 10:59:27,055 INFO L87 Difference]: Start difference. First operand 8865 states and 12057 transitions. Second operand 6 states. [2019-09-08 10:59:29,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:29,801 INFO L93 Difference]: Finished difference Result 20534 states and 28438 transitions. [2019-09-08 10:59:29,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 10:59:29,802 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 70 [2019-09-08 10:59:29,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:29,837 INFO L225 Difference]: With dead ends: 20534 [2019-09-08 10:59:29,837 INFO L226 Difference]: Without dead ends: 14474 [2019-09-08 10:59:29,854 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2019-09-08 10:59:29,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14474 states. [2019-09-08 10:59:30,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14474 to 14429. [2019-09-08 10:59:30,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14429 states. [2019-09-08 10:59:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14429 states to 14429 states and 20022 transitions. [2019-09-08 10:59:30,592 INFO L78 Accepts]: Start accepts. Automaton has 14429 states and 20022 transitions. Word has length 70 [2019-09-08 10:59:30,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:30,593 INFO L475 AbstractCegarLoop]: Abstraction has 14429 states and 20022 transitions. [2019-09-08 10:59:30,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 10:59:30,593 INFO L276 IsEmpty]: Start isEmpty. Operand 14429 states and 20022 transitions. [2019-09-08 10:59:30,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 10:59:30,606 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:30,606 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:59:30,607 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:30,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:30,607 INFO L82 PathProgramCache]: Analyzing trace with hash 451335994, now seen corresponding path program 1 times [2019-09-08 10:59:30,607 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:30,607 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:30,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:30,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:30,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:30,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:59:30,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:30,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:59:30,881 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:59:30,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:59:30,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:59:30,882 INFO L87 Difference]: Start difference. First operand 14429 states and 20022 transitions. Second operand 9 states. [2019-09-08 10:59:40,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:40,227 INFO L93 Difference]: Finished difference Result 44656 states and 65002 transitions. [2019-09-08 10:59:40,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 10:59:40,228 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 70 [2019-09-08 10:59:40,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:40,325 INFO L225 Difference]: With dead ends: 44656 [2019-09-08 10:59:40,325 INFO L226 Difference]: Without dead ends: 40572 [2019-09-08 10:59:40,348 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=160, Invalid=440, Unknown=0, NotChecked=0, Total=600 [2019-09-08 10:59:40,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40572 states. [2019-09-08 10:59:41,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40572 to 14347. [2019-09-08 10:59:41,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14347 states. [2019-09-08 10:59:41,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14347 states to 14347 states and 19905 transitions. [2019-09-08 10:59:41,469 INFO L78 Accepts]: Start accepts. Automaton has 14347 states and 19905 transitions. Word has length 70 [2019-09-08 10:59:41,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:41,471 INFO L475 AbstractCegarLoop]: Abstraction has 14347 states and 19905 transitions. [2019-09-08 10:59:41,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:59:41,471 INFO L276 IsEmpty]: Start isEmpty. Operand 14347 states and 19905 transitions. [2019-09-08 10:59:41,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:59:41,487 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:41,487 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:59:41,488 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:41,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:41,492 INFO L82 PathProgramCache]: Analyzing trace with hash 870882905, now seen corresponding path program 1 times [2019-09-08 10:59:41,493 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:41,494 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:41,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:41,495 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:41,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:41,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:42,060 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:59:42,060 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:42,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 10:59:42,061 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 10:59:42,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 10:59:42,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-09-08 10:59:42,061 INFO L87 Difference]: Start difference. First operand 14347 states and 19905 transitions. Second operand 12 states. [2019-09-08 10:59:49,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:49,795 INFO L93 Difference]: Finished difference Result 60969 states and 92089 transitions. [2019-09-08 10:59:49,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 10:59:49,796 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 71 [2019-09-08 10:59:49,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:49,924 INFO L225 Difference]: With dead ends: 60969 [2019-09-08 10:59:49,925 INFO L226 Difference]: Without dead ends: 56885 [2019-09-08 10:59:49,948 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=207, Invalid=663, Unknown=0, NotChecked=0, Total=870 [2019-09-08 10:59:50,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56885 states. [2019-09-08 10:59:51,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56885 to 14261. [2019-09-08 10:59:51,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14261 states. [2019-09-08 10:59:51,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14261 states to 14261 states and 19779 transitions. [2019-09-08 10:59:51,126 INFO L78 Accepts]: Start accepts. Automaton has 14261 states and 19779 transitions. Word has length 71 [2019-09-08 10:59:51,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:51,126 INFO L475 AbstractCegarLoop]: Abstraction has 14261 states and 19779 transitions. [2019-09-08 10:59:51,127 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 10:59:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 14261 states and 19779 transitions. [2019-09-08 10:59:51,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:59:51,140 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:51,141 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:59:51,141 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:51,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:51,142 INFO L82 PathProgramCache]: Analyzing trace with hash 350453109, now seen corresponding path program 1 times [2019-09-08 10:59:51,142 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:51,142 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:51,143 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:51,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:51,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:51,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:51,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:59:51,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:51,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:59:51,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:59:51,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:59:51,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:59:51,380 INFO L87 Difference]: Start difference. First operand 14261 states and 19779 transitions. Second operand 9 states. [2019-09-08 10:59:58,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 10:59:58,578 INFO L93 Difference]: Finished difference Result 22297 states and 32214 transitions. [2019-09-08 10:59:58,579 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-09-08 10:59:58,579 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-08 10:59:58,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 10:59:58,607 INFO L225 Difference]: With dead ends: 22297 [2019-09-08 10:59:58,608 INFO L226 Difference]: Without dead ends: 22292 [2019-09-08 10:59:58,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=237, Unknown=0, NotChecked=0, Total=342 [2019-09-08 10:59:58,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22292 states. [2019-09-08 10:59:59,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22292 to 14261. [2019-09-08 10:59:59,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14261 states. [2019-09-08 10:59:59,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14261 states to 14261 states and 19778 transitions. [2019-09-08 10:59:59,429 INFO L78 Accepts]: Start accepts. Automaton has 14261 states and 19778 transitions. Word has length 71 [2019-09-08 10:59:59,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 10:59:59,429 INFO L475 AbstractCegarLoop]: Abstraction has 14261 states and 19778 transitions. [2019-09-08 10:59:59,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 10:59:59,429 INFO L276 IsEmpty]: Start isEmpty. Operand 14261 states and 19778 transitions. [2019-09-08 10:59:59,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 10:59:59,439 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 10:59:59,440 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 10:59:59,440 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 10:59:59,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 10:59:59,441 INFO L82 PathProgramCache]: Analyzing trace with hash -2100398418, now seen corresponding path program 1 times [2019-09-08 10:59:59,441 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 10:59:59,441 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 10:59:59,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:59,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 10:59:59,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 10:59:59,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 10:59:59,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 10:59:59,649 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 10:59:59,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 10:59:59,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 10:59:59,650 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 10:59:59,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 10:59:59,650 INFO L87 Difference]: Start difference. First operand 14261 states and 19778 transitions. Second operand 9 states. [2019-09-08 11:00:07,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:07,627 INFO L93 Difference]: Finished difference Result 22660 states and 32424 transitions. [2019-09-08 11:00:07,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 11:00:07,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 71 [2019-09-08 11:00:07,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:07,651 INFO L225 Difference]: With dead ends: 22660 [2019-09-08 11:00:07,651 INFO L226 Difference]: Without dead ends: 22652 [2019-09-08 11:00:07,656 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=321, Unknown=0, NotChecked=0, Total=462 [2019-09-08 11:00:07,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22652 states. [2019-09-08 11:00:08,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22652 to 14261. [2019-09-08 11:00:08,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14261 states. [2019-09-08 11:00:08,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14261 states to 14261 states and 19777 transitions. [2019-09-08 11:00:08,507 INFO L78 Accepts]: Start accepts. Automaton has 14261 states and 19777 transitions. Word has length 71 [2019-09-08 11:00:08,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:08,507 INFO L475 AbstractCegarLoop]: Abstraction has 14261 states and 19777 transitions. [2019-09-08 11:00:08,508 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:00:08,508 INFO L276 IsEmpty]: Start isEmpty. Operand 14261 states and 19777 transitions. [2019-09-08 11:00:08,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 11:00:08,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:08,518 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:00:08,519 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:08,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:08,519 INFO L82 PathProgramCache]: Analyzing trace with hash 343354784, now seen corresponding path program 1 times [2019-09-08 11:00:08,519 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:08,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:08,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:08,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:08,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:08,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:09,073 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:00:09,074 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:09,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 11:00:09,074 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:00:09,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:00:09,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:00:09,075 INFO L87 Difference]: Start difference. First operand 14261 states and 19777 transitions. Second operand 11 states. [2019-09-08 11:00:09,786 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-08 11:00:10,388 WARN L188 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 45 [2019-09-08 11:00:10,755 WARN L188 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 38 [2019-09-08 11:00:11,374 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 40 [2019-09-08 11:00:12,952 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 44 [2019-09-08 11:00:16,594 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 46 [2019-09-08 11:00:23,737 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 45 [2019-09-08 11:00:26,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:26,858 INFO L93 Difference]: Finished difference Result 89127 states and 135612 transitions. [2019-09-08 11:00:26,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 11:00:26,859 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 71 [2019-09-08 11:00:26,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:26,958 INFO L225 Difference]: With dead ends: 89127 [2019-09-08 11:00:26,959 INFO L226 Difference]: Without dead ends: 85040 [2019-09-08 11:00:26,985 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 552 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=519, Invalid=1461, Unknown=0, NotChecked=0, Total=1980 [2019-09-08 11:00:27,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85040 states. [2019-09-08 11:00:28,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85040 to 14172. [2019-09-08 11:00:28,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14172 states. [2019-09-08 11:00:28,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14172 states to 14172 states and 19654 transitions. [2019-09-08 11:00:28,507 INFO L78 Accepts]: Start accepts. Automaton has 14172 states and 19654 transitions. Word has length 71 [2019-09-08 11:00:28,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:28,507 INFO L475 AbstractCegarLoop]: Abstraction has 14172 states and 19654 transitions. [2019-09-08 11:00:28,507 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:00:28,507 INFO L276 IsEmpty]: Start isEmpty. Operand 14172 states and 19654 transitions. [2019-09-08 11:00:28,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:00:28,514 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:28,515 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:00:28,515 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:28,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:28,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1658925808, now seen corresponding path program 1 times [2019-09-08 11:00:28,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:28,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:28,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:28,517 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:28,517 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:28,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:29,044 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:00:29,045 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:29,045 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 11:00:29,046 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 11:00:29,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 11:00:29,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-09-08 11:00:29,047 INFO L87 Difference]: Start difference. First operand 14172 states and 19654 transitions. Second operand 12 states. [2019-09-08 11:00:42,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:42,920 INFO L93 Difference]: Finished difference Result 56834 states and 85689 transitions. [2019-09-08 11:00:42,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-08 11:00:42,920 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 72 [2019-09-08 11:00:42,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:42,995 INFO L225 Difference]: With dead ends: 56834 [2019-09-08 11:00:42,996 INFO L226 Difference]: Without dead ends: 56826 [2019-09-08 11:00:43,008 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=204, Invalid=666, Unknown=0, NotChecked=0, Total=870 [2019-09-08 11:00:43,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56826 states. [2019-09-08 11:00:44,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56826 to 14164. [2019-09-08 11:00:44,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14164 states. [2019-09-08 11:00:44,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14164 states to 14164 states and 19645 transitions. [2019-09-08 11:00:44,592 INFO L78 Accepts]: Start accepts. Automaton has 14164 states and 19645 transitions. Word has length 72 [2019-09-08 11:00:44,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:00:44,592 INFO L475 AbstractCegarLoop]: Abstraction has 14164 states and 19645 transitions. [2019-09-08 11:00:44,592 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 11:00:44,592 INFO L276 IsEmpty]: Start isEmpty. Operand 14164 states and 19645 transitions. [2019-09-08 11:00:44,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:00:44,600 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:00:44,600 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:00:44,600 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:00:44,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:00:44,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1364499548, now seen corresponding path program 1 times [2019-09-08 11:00:44,601 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:00:44,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:00:44,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:44,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:00:44,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:00:44,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:00:44,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:00:44,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:00:44,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:00:44,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:00:44,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:00:44,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:00:44,798 INFO L87 Difference]: Start difference. First operand 14164 states and 19645 transitions. Second operand 9 states. [2019-09-08 11:00:58,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:00:58,883 INFO L93 Difference]: Finished difference Result 44447 states and 64708 transitions. [2019-09-08 11:00:58,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:00:58,884 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-08 11:00:58,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:00:58,927 INFO L225 Difference]: With dead ends: 44447 [2019-09-08 11:00:58,927 INFO L226 Difference]: Without dead ends: 40351 [2019-09-08 11:00:58,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=438, Unknown=0, NotChecked=0, Total=600 [2019-09-08 11:00:58,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40351 states. [2019-09-08 11:01:00,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40351 to 14164. [2019-09-08 11:01:00,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14164 states. [2019-09-08 11:01:00,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14164 states to 14164 states and 19644 transitions. [2019-09-08 11:01:00,617 INFO L78 Accepts]: Start accepts. Automaton has 14164 states and 19644 transitions. Word has length 72 [2019-09-08 11:01:00,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:00,617 INFO L475 AbstractCegarLoop]: Abstraction has 14164 states and 19644 transitions. [2019-09-08 11:01:00,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:01:00,617 INFO L276 IsEmpty]: Start isEmpty. Operand 14164 states and 19644 transitions. [2019-09-08 11:01:00,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:01:00,625 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:00,625 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:01:00,625 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:00,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:00,626 INFO L82 PathProgramCache]: Analyzing trace with hash -313639877, now seen corresponding path program 1 times [2019-09-08 11:01:00,626 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:00,626 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:00,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:00,627 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:00,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:00,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:00,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:00,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:01:00,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:01:00,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:01:00,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:01:00,857 INFO L87 Difference]: Start difference. First operand 14164 states and 19644 transitions. Second operand 9 states. [2019-09-08 11:01:12,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:12,780 INFO L93 Difference]: Finished difference Result 35909 states and 52992 transitions. [2019-09-08 11:01:12,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 11:01:12,781 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 72 [2019-09-08 11:01:12,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:12,813 INFO L225 Difference]: With dead ends: 35909 [2019-09-08 11:01:12,813 INFO L226 Difference]: Without dead ends: 31888 [2019-09-08 11:01:12,825 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=222, Invalid=590, Unknown=0, NotChecked=0, Total=812 [2019-09-08 11:01:12,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31888 states. [2019-09-08 11:01:14,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31888 to 14164. [2019-09-08 11:01:14,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14164 states. [2019-09-08 11:01:14,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14164 states to 14164 states and 19643 transitions. [2019-09-08 11:01:14,278 INFO L78 Accepts]: Start accepts. Automaton has 14164 states and 19643 transitions. Word has length 72 [2019-09-08 11:01:14,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:14,279 INFO L475 AbstractCegarLoop]: Abstraction has 14164 states and 19643 transitions. [2019-09-08 11:01:14,279 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:01:14,279 INFO L276 IsEmpty]: Start isEmpty. Operand 14164 states and 19643 transitions. [2019-09-08 11:01:14,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:01:14,287 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:14,287 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:01:14,288 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:14,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:14,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1017120245, now seen corresponding path program 1 times [2019-09-08 11:01:14,288 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:14,288 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:14,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:14,289 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:14,289 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:14,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:14,535 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:14,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:14,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-08 11:01:14,536 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 11:01:14,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 11:01:14,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-09-08 11:01:14,537 INFO L87 Difference]: Start difference. First operand 14164 states and 19643 transitions. Second operand 8 states. [2019-09-08 11:01:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:25,040 INFO L93 Difference]: Finished difference Result 38650 states and 57563 transitions. [2019-09-08 11:01:25,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-09-08 11:01:25,040 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 72 [2019-09-08 11:01:25,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:25,075 INFO L225 Difference]: With dead ends: 38650 [2019-09-08 11:01:25,075 INFO L226 Difference]: Without dead ends: 33927 [2019-09-08 11:01:25,086 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=211, Unknown=0, NotChecked=0, Total=306 [2019-09-08 11:01:25,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33927 states. [2019-09-08 11:01:26,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33927 to 14164. [2019-09-08 11:01:26,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14164 states. [2019-09-08 11:01:26,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14164 states to 14164 states and 19642 transitions. [2019-09-08 11:01:26,754 INFO L78 Accepts]: Start accepts. Automaton has 14164 states and 19642 transitions. Word has length 72 [2019-09-08 11:01:26,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:26,754 INFO L475 AbstractCegarLoop]: Abstraction has 14164 states and 19642 transitions. [2019-09-08 11:01:26,754 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 11:01:26,754 INFO L276 IsEmpty]: Start isEmpty. Operand 14164 states and 19642 transitions. [2019-09-08 11:01:26,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:01:26,762 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:26,762 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:01:26,763 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:26,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:26,763 INFO L82 PathProgramCache]: Analyzing trace with hash 98934365, now seen corresponding path program 1 times [2019-09-08 11:01:26,763 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:26,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:26,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:26,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:26,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:26,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:27,159 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:27,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 11:01:27,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 11:01:27,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 11:01:27,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-09-08 11:01:27,160 INFO L87 Difference]: Start difference. First operand 14164 states and 19642 transitions. Second operand 11 states. [2019-09-08 11:01:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:44,740 INFO L93 Difference]: Finished difference Result 66595 states and 100912 transitions. [2019-09-08 11:01:44,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-09-08 11:01:44,741 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 72 [2019-09-08 11:01:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:44,812 INFO L225 Difference]: With dead ends: 66595 [2019-09-08 11:01:44,812 INFO L226 Difference]: Without dead ends: 62405 [2019-09-08 11:01:44,830 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=203, Invalid=553, Unknown=0, NotChecked=0, Total=756 [2019-09-08 11:01:44,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62405 states. [2019-09-08 11:01:46,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62405 to 14121. [2019-09-08 11:01:46,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14121 states. [2019-09-08 11:01:46,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14121 states to 14121 states and 19591 transitions. [2019-09-08 11:01:46,655 INFO L78 Accepts]: Start accepts. Automaton has 14121 states and 19591 transitions. Word has length 72 [2019-09-08 11:01:46,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:46,655 INFO L475 AbstractCegarLoop]: Abstraction has 14121 states and 19591 transitions. [2019-09-08 11:01:46,655 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 11:01:46,656 INFO L276 IsEmpty]: Start isEmpty. Operand 14121 states and 19591 transitions. [2019-09-08 11:01:46,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 11:01:46,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:46,662 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:01:46,662 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:46,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:46,663 INFO L82 PathProgramCache]: Analyzing trace with hash 997156317, now seen corresponding path program 1 times [2019-09-08 11:01:46,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:46,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:46,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:46,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:46,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:46,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:46,757 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:46,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:46,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:01:46,758 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:01:46,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:01:46,759 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:01:46,759 INFO L87 Difference]: Start difference. First operand 14121 states and 19591 transitions. Second operand 3 states. [2019-09-08 11:01:49,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:49,294 INFO L93 Difference]: Finished difference Result 22038 states and 31590 transitions. [2019-09-08 11:01:49,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:01:49,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 72 [2019-09-08 11:01:49,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:49,310 INFO L225 Difference]: With dead ends: 22038 [2019-09-08 11:01:49,310 INFO L226 Difference]: Without dead ends: 13395 [2019-09-08 11:01:49,323 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:01:49,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13395 states. [2019-09-08 11:01:51,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13395 to 13377. [2019-09-08 11:01:51,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13377 states. [2019-09-08 11:01:51,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13377 states to 13377 states and 19114 transitions. [2019-09-08 11:01:51,435 INFO L78 Accepts]: Start accepts. Automaton has 13377 states and 19114 transitions. Word has length 72 [2019-09-08 11:01:51,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:51,435 INFO L475 AbstractCegarLoop]: Abstraction has 13377 states and 19114 transitions. [2019-09-08 11:01:51,435 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:01:51,435 INFO L276 IsEmpty]: Start isEmpty. Operand 13377 states and 19114 transitions. [2019-09-08 11:01:51,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:01:51,442 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:51,442 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:01:51,443 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:51,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:51,443 INFO L82 PathProgramCache]: Analyzing trace with hash 2144380542, now seen corresponding path program 1 times [2019-09-08 11:01:51,443 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:51,443 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:51,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:51,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:51,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:51,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:51,544 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:51,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:01:51,544 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:01:51,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:01:51,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:01:51,545 INFO L87 Difference]: Start difference. First operand 13377 states and 19114 transitions. Second operand 3 states. [2019-09-08 11:01:55,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:01:55,490 INFO L93 Difference]: Finished difference Result 28830 states and 42305 transitions. [2019-09-08 11:01:55,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:01:55,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 11:01:55,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:01:55,517 INFO L225 Difference]: With dead ends: 28830 [2019-09-08 11:01:55,517 INFO L226 Difference]: Without dead ends: 20999 [2019-09-08 11:01:55,531 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:01:55,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20999 states. [2019-09-08 11:01:59,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20999 to 18856. [2019-09-08 11:01:59,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18856 states. [2019-09-08 11:01:59,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18856 states to 18856 states and 26966 transitions. [2019-09-08 11:01:59,045 INFO L78 Accepts]: Start accepts. Automaton has 18856 states and 26966 transitions. Word has length 73 [2019-09-08 11:01:59,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:01:59,046 INFO L475 AbstractCegarLoop]: Abstraction has 18856 states and 26966 transitions. [2019-09-08 11:01:59,046 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:01:59,046 INFO L276 IsEmpty]: Start isEmpty. Operand 18856 states and 26966 transitions. [2019-09-08 11:01:59,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:01:59,052 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:01:59,052 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:01:59,052 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:01:59,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:01:59,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1936130210, now seen corresponding path program 1 times [2019-09-08 11:01:59,053 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:01:59,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:01:59,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:59,055 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:01:59,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:01:59,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:01:59,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:01:59,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:01:59,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:01:59,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:01:59,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:01:59,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:01:59,151 INFO L87 Difference]: Start difference. First operand 18856 states and 26966 transitions. Second operand 3 states. [2019-09-08 11:02:05,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:05,430 INFO L93 Difference]: Finished difference Result 38208 states and 56772 transitions. [2019-09-08 11:02:05,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:05,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 11:02:05,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:05,465 INFO L225 Difference]: With dead ends: 38208 [2019-09-08 11:02:05,465 INFO L226 Difference]: Without dead ends: 26623 [2019-09-08 11:02:05,483 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:05,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26623 states. [2019-09-08 11:02:10,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26623 to 20591. [2019-09-08 11:02:10,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20591 states. [2019-09-08 11:02:11,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20591 states to 20591 states and 29758 transitions. [2019-09-08 11:02:11,014 INFO L78 Accepts]: Start accepts. Automaton has 20591 states and 29758 transitions. Word has length 73 [2019-09-08 11:02:11,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:11,014 INFO L475 AbstractCegarLoop]: Abstraction has 20591 states and 29758 transitions. [2019-09-08 11:02:11,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:11,015 INFO L276 IsEmpty]: Start isEmpty. Operand 20591 states and 29758 transitions. [2019-09-08 11:02:11,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:02:11,020 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:11,020 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:02:11,021 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:11,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:11,021 INFO L82 PathProgramCache]: Analyzing trace with hash -2045368516, now seen corresponding path program 1 times [2019-09-08 11:02:11,021 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:11,021 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:11,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:11,022 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:11,022 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:11,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:11,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:02:11,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:11,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:11,116 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:11,116 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:11,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:11,117 INFO L87 Difference]: Start difference. First operand 20591 states and 29758 transitions. Second operand 3 states. [2019-09-08 11:02:19,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:19,901 INFO L93 Difference]: Finished difference Result 48811 states and 71913 transitions. [2019-09-08 11:02:19,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:19,901 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 11:02:19,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:19,942 INFO L225 Difference]: With dead ends: 48811 [2019-09-08 11:02:19,942 INFO L226 Difference]: Without dead ends: 32610 [2019-09-08 11:02:19,959 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:19,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32610 states. [2019-09-08 11:02:28,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32610 to 32602. [2019-09-08 11:02:28,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32602 states. [2019-09-08 11:02:28,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32602 states to 32602 states and 47157 transitions. [2019-09-08 11:02:28,196 INFO L78 Accepts]: Start accepts. Automaton has 32602 states and 47157 transitions. Word has length 73 [2019-09-08 11:02:28,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:28,196 INFO L475 AbstractCegarLoop]: Abstraction has 32602 states and 47157 transitions. [2019-09-08 11:02:28,196 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:28,196 INFO L276 IsEmpty]: Start isEmpty. Operand 32602 states and 47157 transitions. [2019-09-08 11:02:28,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2019-09-08 11:02:28,202 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:28,202 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:02:28,202 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:28,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:28,203 INFO L82 PathProgramCache]: Analyzing trace with hash 466736798, now seen corresponding path program 1 times [2019-09-08 11:02:28,203 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:28,203 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:28,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:28,204 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:28,204 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:28,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:28,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:02:28,287 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:28,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:28,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:28,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:28,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:28,289 INFO L87 Difference]: Start difference. First operand 32602 states and 47157 transitions. Second operand 3 states. [2019-09-08 11:02:42,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:02:42,719 INFO L93 Difference]: Finished difference Result 74590 states and 110043 transitions. [2019-09-08 11:02:42,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:02:42,723 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 73 [2019-09-08 11:02:42,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:02:42,776 INFO L225 Difference]: With dead ends: 74590 [2019-09-08 11:02:42,777 INFO L226 Difference]: Without dead ends: 45897 [2019-09-08 11:02:42,806 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:42,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45897 states. [2019-09-08 11:02:56,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45897 to 45889. [2019-09-08 11:02:56,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45889 states. [2019-09-08 11:02:56,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45889 states to 45889 states and 67506 transitions. [2019-09-08 11:02:56,275 INFO L78 Accepts]: Start accepts. Automaton has 45889 states and 67506 transitions. Word has length 73 [2019-09-08 11:02:56,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:02:56,275 INFO L475 AbstractCegarLoop]: Abstraction has 45889 states and 67506 transitions. [2019-09-08 11:02:56,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:02:56,276 INFO L276 IsEmpty]: Start isEmpty. Operand 45889 states and 67506 transitions. [2019-09-08 11:02:56,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 11:02:56,281 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:02:56,281 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:02:56,281 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:02:56,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:02:56,282 INFO L82 PathProgramCache]: Analyzing trace with hash -1267420457, now seen corresponding path program 1 times [2019-09-08 11:02:56,282 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:02:56,282 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:02:56,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:56,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:02:56,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:02:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:02:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:02:56,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:02:56,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:02:56,380 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:02:56,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:02:56,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:02:56,381 INFO L87 Difference]: Start difference. First operand 45889 states and 67506 transitions. Second operand 3 states. [2019-09-08 11:03:14,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:03:14,430 INFO L93 Difference]: Finished difference Result 97587 states and 144524 transitions. [2019-09-08 11:03:14,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:03:14,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 11:03:14,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:03:14,493 INFO L225 Difference]: With dead ends: 97587 [2019-09-08 11:03:14,493 INFO L226 Difference]: Without dead ends: 53559 [2019-09-08 11:03:14,533 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:03:14,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53559 states. [2019-09-08 11:03:27,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53559 to 42604. [2019-09-08 11:03:27,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42604 states. [2019-09-08 11:03:27,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42604 states to 42604 states and 63106 transitions. [2019-09-08 11:03:27,591 INFO L78 Accepts]: Start accepts. Automaton has 42604 states and 63106 transitions. Word has length 74 [2019-09-08 11:03:27,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:03:27,591 INFO L475 AbstractCegarLoop]: Abstraction has 42604 states and 63106 transitions. [2019-09-08 11:03:27,591 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:03:27,591 INFO L276 IsEmpty]: Start isEmpty. Operand 42604 states and 63106 transitions. [2019-09-08 11:03:27,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-08 11:03:27,595 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:03:27,595 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:03:27,596 INFO L418 AbstractCegarLoop]: === Iteration 22 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:03:27,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:03:27,596 INFO L82 PathProgramCache]: Analyzing trace with hash -993095660, now seen corresponding path program 1 times [2019-09-08 11:03:27,596 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:03:27,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:03:27,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:27,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:03:27,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:03:27,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:03:27,700 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:03:27,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:03:27,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:03:27,701 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:03:27,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:03:27,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:03:27,702 INFO L87 Difference]: Start difference. First operand 42604 states and 63106 transitions. Second operand 3 states. [2019-09-08 11:03:52,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:03:52,435 INFO L93 Difference]: Finished difference Result 113733 states and 169998 transitions. [2019-09-08 11:03:52,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:03:52,436 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-08 11:03:52,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:03:52,527 INFO L225 Difference]: With dead ends: 113733 [2019-09-08 11:03:52,528 INFO L226 Difference]: Without dead ends: 72255 [2019-09-08 11:03:52,562 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:03:52,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72255 states. [2019-09-08 11:04:10,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72255 to 55859. [2019-09-08 11:04:10,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55859 states. [2019-09-08 11:04:10,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55859 states to 55859 states and 83395 transitions. [2019-09-08 11:04:10,234 INFO L78 Accepts]: Start accepts. Automaton has 55859 states and 83395 transitions. Word has length 74 [2019-09-08 11:04:10,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:04:10,234 INFO L475 AbstractCegarLoop]: Abstraction has 55859 states and 83395 transitions. [2019-09-08 11:04:10,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:04:10,234 INFO L276 IsEmpty]: Start isEmpty. Operand 55859 states and 83395 transitions. [2019-09-08 11:04:10,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:04:10,237 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:04:10,237 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:04:10,237 INFO L418 AbstractCegarLoop]: === Iteration 23 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:04:10,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:04:10,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1708157951, now seen corresponding path program 1 times [2019-09-08 11:04:10,238 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:04:10,238 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:04:10,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:10,239 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:04:10,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:04:10,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:04:10,441 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:04:10,442 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:04:10,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:04:10,442 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:04:10,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:04:10,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:04:10,447 INFO L87 Difference]: Start difference. First operand 55859 states and 83395 transitions. Second operand 9 states. [2019-09-08 11:04:58,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:04:58,166 INFO L93 Difference]: Finished difference Result 131773 states and 196769 transitions. [2019-09-08 11:04:58,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-09-08 11:04:58,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 11:04:58,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:04:58,339 INFO L225 Difference]: With dead ends: 131773 [2019-09-08 11:04:58,339 INFO L226 Difference]: Without dead ends: 130530 [2019-09-08 11:04:58,367 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2019-09-08 11:04:58,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130530 states. [2019-09-08 11:05:16,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130530 to 55859. [2019-09-08 11:05:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55859 states. [2019-09-08 11:05:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55859 states to 55859 states and 83394 transitions. [2019-09-08 11:05:16,934 INFO L78 Accepts]: Start accepts. Automaton has 55859 states and 83394 transitions. Word has length 75 [2019-09-08 11:05:16,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:05:16,934 INFO L475 AbstractCegarLoop]: Abstraction has 55859 states and 83394 transitions. [2019-09-08 11:05:16,934 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:05:16,934 INFO L276 IsEmpty]: Start isEmpty. Operand 55859 states and 83394 transitions. [2019-09-08 11:05:16,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:05:16,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:05:16,938 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:05:16,938 INFO L418 AbstractCegarLoop]: === Iteration 24 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:05:16,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:05:16,939 INFO L82 PathProgramCache]: Analyzing trace with hash -592179090, now seen corresponding path program 1 times [2019-09-08 11:05:16,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:05:16,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:05:16,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:16,940 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:05:16,940 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:05:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:05:17,114 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:05:17,115 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:05:17,115 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:05:17,115 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:05:17,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:05:17,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:05:17,116 INFO L87 Difference]: Start difference. First operand 55859 states and 83394 transitions. Second operand 9 states. [2019-09-08 11:05:55,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:05:55,224 INFO L93 Difference]: Finished difference Result 99931 states and 148792 transitions. [2019-09-08 11:05:55,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:05:55,225 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 11:05:55,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:05:55,353 INFO L225 Difference]: With dead ends: 99931 [2019-09-08 11:05:55,353 INFO L226 Difference]: Without dead ends: 98669 [2019-09-08 11:05:55,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:05:55,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98669 states. [2019-09-08 11:06:14,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98669 to 55859. [2019-09-08 11:06:14,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55859 states. [2019-09-08 11:06:14,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55859 states to 55859 states and 83393 transitions. [2019-09-08 11:06:14,101 INFO L78 Accepts]: Start accepts. Automaton has 55859 states and 83393 transitions. Word has length 75 [2019-09-08 11:06:14,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:06:14,102 INFO L475 AbstractCegarLoop]: Abstraction has 55859 states and 83393 transitions. [2019-09-08 11:06:14,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:06:14,102 INFO L276 IsEmpty]: Start isEmpty. Operand 55859 states and 83393 transitions. [2019-09-08 11:06:14,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:06:14,104 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:06:14,104 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:06:14,104 INFO L418 AbstractCegarLoop]: === Iteration 25 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:06:14,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:06:14,105 INFO L82 PathProgramCache]: Analyzing trace with hash 129580343, now seen corresponding path program 1 times [2019-09-08 11:06:14,105 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:06:14,105 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:06:14,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:14,106 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:06:14,106 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:06:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:06:14,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:06:14,268 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:06:14,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:06:14,269 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:06:14,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:06:14,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:06:14,269 INFO L87 Difference]: Start difference. First operand 55859 states and 83393 transitions. Second operand 9 states. [2019-09-08 11:07:14,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:07:14,201 INFO L93 Difference]: Finished difference Result 157059 states and 232963 transitions. [2019-09-08 11:07:14,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-09-08 11:07:14,202 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 11:07:14,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:07:14,408 INFO L225 Difference]: With dead ends: 157059 [2019-09-08 11:07:14,408 INFO L226 Difference]: Without dead ends: 155702 [2019-09-08 11:07:14,441 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=368, Unknown=0, NotChecked=0, Total=506 [2019-09-08 11:07:14,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155702 states. [2019-09-08 11:07:33,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155702 to 55859. [2019-09-08 11:07:33,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55859 states. [2019-09-08 11:07:33,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55859 states to 55859 states and 83392 transitions. [2019-09-08 11:07:33,475 INFO L78 Accepts]: Start accepts. Automaton has 55859 states and 83392 transitions. Word has length 75 [2019-09-08 11:07:33,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:07:33,476 INFO L475 AbstractCegarLoop]: Abstraction has 55859 states and 83392 transitions. [2019-09-08 11:07:33,476 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:07:33,476 INFO L276 IsEmpty]: Start isEmpty. Operand 55859 states and 83392 transitions. [2019-09-08 11:07:33,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:07:33,478 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:07:33,478 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:07:33,479 INFO L418 AbstractCegarLoop]: === Iteration 26 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:07:33,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:07:33,479 INFO L82 PathProgramCache]: Analyzing trace with hash -1422892121, now seen corresponding path program 1 times [2019-09-08 11:07:33,479 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:07:33,479 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:07:33,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:33,480 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:07:33,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:07:33,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:07:33,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:07:33,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:07:33,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:07:33,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:07:33,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:07:33,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:07:33,658 INFO L87 Difference]: Start difference. First operand 55859 states and 83392 transitions. Second operand 9 states. [2019-09-08 11:08:11,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:08:11,310 INFO L93 Difference]: Finished difference Result 99890 states and 148745 transitions. [2019-09-08 11:08:11,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:08:11,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 11:08:11,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:08:11,442 INFO L225 Difference]: With dead ends: 99890 [2019-09-08 11:08:11,443 INFO L226 Difference]: Without dead ends: 98644 [2019-09-08 11:08:11,465 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:08:11,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98644 states. [2019-09-08 11:08:32,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98644 to 55859. [2019-09-08 11:08:32,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55859 states. [2019-09-08 11:08:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55859 states to 55859 states and 83390 transitions. [2019-09-08 11:08:32,354 INFO L78 Accepts]: Start accepts. Automaton has 55859 states and 83390 transitions. Word has length 75 [2019-09-08 11:08:32,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:08:32,354 INFO L475 AbstractCegarLoop]: Abstraction has 55859 states and 83390 transitions. [2019-09-08 11:08:32,354 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:08:32,354 INFO L276 IsEmpty]: Start isEmpty. Operand 55859 states and 83390 transitions. [2019-09-08 11:08:32,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:08:32,357 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:08:32,357 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:08:32,357 INFO L418 AbstractCegarLoop]: === Iteration 27 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:08:32,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:08:32,357 INFO L82 PathProgramCache]: Analyzing trace with hash -1817625223, now seen corresponding path program 1 times [2019-09-08 11:08:32,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:08:32,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:08:32,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:32,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:08:32,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:08:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:08:32,521 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:08:32,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:08:32,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:08:32,522 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:08:32,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:08:32,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:08:32,522 INFO L87 Difference]: Start difference. First operand 55859 states and 83390 transitions. Second operand 9 states. [2019-09-08 11:09:10,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:09:10,934 INFO L93 Difference]: Finished difference Result 99890 states and 148743 transitions. [2019-09-08 11:09:10,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:09:10,935 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 11:09:10,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:09:11,058 INFO L225 Difference]: With dead ends: 99890 [2019-09-08 11:09:11,058 INFO L226 Difference]: Without dead ends: 98644 [2019-09-08 11:09:11,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:09:11,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98644 states. [2019-09-08 11:09:30,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98644 to 55859. [2019-09-08 11:09:30,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55859 states. [2019-09-08 11:09:30,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55859 states to 55859 states and 83388 transitions. [2019-09-08 11:09:30,254 INFO L78 Accepts]: Start accepts. Automaton has 55859 states and 83388 transitions. Word has length 75 [2019-09-08 11:09:30,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:09:30,254 INFO L475 AbstractCegarLoop]: Abstraction has 55859 states and 83388 transitions. [2019-09-08 11:09:30,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:09:30,255 INFO L276 IsEmpty]: Start isEmpty. Operand 55859 states and 83388 transitions. [2019-09-08 11:09:30,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 11:09:30,258 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:09:30,258 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:09:30,259 INFO L418 AbstractCegarLoop]: === Iteration 28 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:09:30,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:09:30,259 INFO L82 PathProgramCache]: Analyzing trace with hash -182574823, now seen corresponding path program 1 times [2019-09-08 11:09:30,259 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:09:30,259 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:09:30,260 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:30,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:09:30,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:09:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:09:30,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:09:30,430 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:09:30,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:09:30,430 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:09:30,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:09:30,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:09:30,431 INFO L87 Difference]: Start difference. First operand 55859 states and 83388 transitions. Second operand 9 states. [2019-09-08 11:10:10,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:10:10,569 INFO L93 Difference]: Finished difference Result 99953 states and 148813 transitions. [2019-09-08 11:10:10,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-09-08 11:10:10,570 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2019-09-08 11:10:10,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:10:10,696 INFO L225 Difference]: With dead ends: 99953 [2019-09-08 11:10:10,696 INFO L226 Difference]: Without dead ends: 98669 [2019-09-08 11:10:10,718 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2019-09-08 11:10:10,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98669 states. [2019-09-08 11:10:29,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98669 to 55859. [2019-09-08 11:10:29,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55859 states. [2019-09-08 11:10:29,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55859 states to 55859 states and 83386 transitions. [2019-09-08 11:10:29,903 INFO L78 Accepts]: Start accepts. Automaton has 55859 states and 83386 transitions. Word has length 75 [2019-09-08 11:10:29,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:10:29,903 INFO L475 AbstractCegarLoop]: Abstraction has 55859 states and 83386 transitions. [2019-09-08 11:10:29,903 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-08 11:10:29,903 INFO L276 IsEmpty]: Start isEmpty. Operand 55859 states and 83386 transitions. [2019-09-08 11:10:29,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:10:29,906 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:10:29,906 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:10:29,906 INFO L418 AbstractCegarLoop]: === Iteration 29 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:10:29,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:10:29,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1398382405, now seen corresponding path program 1 times [2019-09-08 11:10:29,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:10:29,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:10:29,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:29,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:10:29,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:10:29,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:10:30,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:10:30,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:10:30,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 11:10:30,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 11:10:30,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 11:10:30,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:10:30,002 INFO L87 Difference]: Start difference. First operand 55859 states and 83386 transitions. Second operand 3 states. [2019-09-08 11:11:05,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 11:11:05,310 INFO L93 Difference]: Finished difference Result 155297 states and 233079 transitions. [2019-09-08 11:11:05,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 11:11:05,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 76 [2019-09-08 11:11:05,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 11:11:05,464 INFO L225 Difference]: With dead ends: 155297 [2019-09-08 11:11:05,464 INFO L226 Difference]: Without dead ends: 101490 [2019-09-08 11:11:05,620 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 11:11:05,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101490 states. [2019-09-08 11:11:34,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101490 to 70170. [2019-09-08 11:11:34,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70170 states. [2019-09-08 11:11:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70170 states to 70170 states and 103786 transitions. [2019-09-08 11:11:34,593 INFO L78 Accepts]: Start accepts. Automaton has 70170 states and 103786 transitions. Word has length 76 [2019-09-08 11:11:34,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 11:11:34,593 INFO L475 AbstractCegarLoop]: Abstraction has 70170 states and 103786 transitions. [2019-09-08 11:11:34,593 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 11:11:34,593 INFO L276 IsEmpty]: Start isEmpty. Operand 70170 states and 103786 transitions. [2019-09-08 11:11:34,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 11:11:34,596 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 11:11:34,596 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 11:11:34,596 INFO L418 AbstractCegarLoop]: === Iteration 30 === [mainErr16ASSERT_VIOLATIONERROR_FUNCTION, mainErr3ASSERT_VIOLATIONERROR_FUNCTION, mainErr9ASSERT_VIOLATIONERROR_FUNCTION, mainErr15ASSERT_VIOLATIONERROR_FUNCTION, mainErr7ASSERT_VIOLATIONERROR_FUNCTION, mainErr13ASSERT_VIOLATIONERROR_FUNCTION, mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr8ASSERT_VIOLATIONERROR_FUNCTION, mainErr10ASSERT_VIOLATIONERROR_FUNCTION, mainErr4ASSERT_VIOLATIONERROR_FUNCTION, mainErr5ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr11ASSERT_VIOLATIONERROR_FUNCTION, mainErr6ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION, mainErr14ASSERT_VIOLATIONERROR_FUNCTION, mainErr12ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 11:11:34,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 11:11:34,597 INFO L82 PathProgramCache]: Analyzing trace with hash 589063280, now seen corresponding path program 1 times [2019-09-08 11:11:34,597 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 11:11:34,597 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 11:11:34,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:34,604 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 11:11:34,604 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 11:11:34,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 11:11:34,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 11:11:34,795 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 11:11:34,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-09-08 11:11:34,796 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-08 11:11:34,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-08 11:11:34,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-09-08 11:11:34,797 INFO L87 Difference]: Start difference. First operand 70170 states and 103786 transitions. Second operand 9 states.