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/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 07:20:04,477 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 07:20:04,479 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 07:20:04,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 07:20:04,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 07:20:04,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 07:20:04,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 07:20:04,509 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 07:20:04,513 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 07:20:04,516 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 07:20:04,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 07:20:04,520 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 07:20:04,521 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 07:20:04,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 07:20:04,525 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 07:20:04,526 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 07:20:04,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 07:20:04,529 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 07:20:04,531 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 07:20:04,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 07:20:04,540 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 07:20:04,542 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 07:20:04,545 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 07:20:04,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 07:20:04,549 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 07:20:04,549 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 07:20:04,549 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 07:20:04,552 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 07:20:04,553 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 07:20:04,554 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 07:20:04,555 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 07:20:04,556 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 07:20:04,557 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 07:20:04,558 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 07:20:04,560 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 07:20:04,560 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 07:20:04,561 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 07:20:04,562 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 07:20:04,562 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 07:20:04,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 07:20:04,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 07:20:04,566 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 07:20:04,601 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 07:20:04,601 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 07:20:04,608 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 07:20:04,608 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 07:20:04,608 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 07:20:04,609 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 07:20:04,609 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 07:20:04,611 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 07:20:04,612 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 07:20:04,612 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 07:20:04,612 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 07:20:04,612 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 07:20:04,612 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 07:20:04,613 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 07:20:04,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 07:20:04,613 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 07:20:04,613 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 07:20:04,613 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 07:20:04,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 07:20:04,614 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 07:20:04,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 07:20:04,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 07:20:04,617 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 07:20:04,617 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 07:20:04,617 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 07:20:04,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 07:20:04,617 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 07:20:04,618 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 07:20:04,618 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 07:20:04,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 07:20:04,667 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 07:20:04,674 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 07:20:04,676 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 07:20:04,676 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 07:20:04,677 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c [2019-09-08 07:20:04,752 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c0524046/396b5a4570bb43dab06c1cab8267a302/FLAG0c203555c [2019-09-08 07:20:05,251 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 07:20:05,252 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c [2019-09-08 07:20:05,268 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c0524046/396b5a4570bb43dab06c1cab8267a302/FLAG0c203555c [2019-09-08 07:20:05,559 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0c0524046/396b5a4570bb43dab06c1cab8267a302 [2019-09-08 07:20:05,572 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 07:20:05,573 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 07:20:05,575 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 07:20:05,575 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 07:20:05,579 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 07:20:05,580 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:20:05" (1/1) ... [2019-09-08 07:20:05,583 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@779b0c5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:20:05, skipping insertion in model container [2019-09-08 07:20:05,583 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 07:20:05" (1/1) ... [2019-09-08 07:20:05,591 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 07:20:05,663 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 07:20:06,111 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:20:06,126 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 07:20:06,249 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 07:20:06,275 INFO L192 MainTranslator]: Completed translation [2019-09-08 07:20:06,276 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:20:06 WrapperNode [2019-09-08 07:20:06,276 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 07:20:06,277 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 07:20:06,277 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 07:20:06,277 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 07:20:06,287 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:20:06" (1/1) ... [2019-09-08 07:20:06,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:20:06" (1/1) ... [2019-09-08 07:20:06,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:20:06" (1/1) ... [2019-09-08 07:20:06,305 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:20:06" (1/1) ... [2019-09-08 07:20:06,332 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:20:06" (1/1) ... [2019-09-08 07:20:06,361 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:20:06" (1/1) ... [2019-09-08 07:20:06,366 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:20:06" (1/1) ... [2019-09-08 07:20:06,375 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 07:20:06,376 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 07:20:06,376 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 07:20:06,376 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 07:20:06,377 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:20:06" (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 07:20:06,457 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 07:20:06,458 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 07:20:06,458 INFO L138 BoogieDeclarations]: Found implementation of procedure node1 [2019-09-08 07:20:06,458 INFO L138 BoogieDeclarations]: Found implementation of procedure node2 [2019-09-08 07:20:06,458 INFO L138 BoogieDeclarations]: Found implementation of procedure node3 [2019-09-08 07:20:06,459 INFO L138 BoogieDeclarations]: Found implementation of procedure node4 [2019-09-08 07:20:06,459 INFO L138 BoogieDeclarations]: Found implementation of procedure init [2019-09-08 07:20:06,459 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2019-09-08 07:20:06,459 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 07:20:06,459 INFO L138 BoogieDeclarations]: Found implementation of procedure assert [2019-09-08 07:20:06,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 07:20:06,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 07:20:06,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 07:20:06,460 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 07:20:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 07:20:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 07:20:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 07:20:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 07:20:06,461 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 07:20:06,462 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 07:20:06,463 INFO L130 BoogieDeclarations]: Found specification of procedure node4 [2019-09-08 07:20:06,464 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 07:20:06,464 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 07:20:06,464 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 07:20:06,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 07:20:06,464 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 07:20:08,092 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 07:20:08,092 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-08 07:20:08,095 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:20:08 BoogieIcfgContainer [2019-09-08 07:20:08,095 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 07:20:08,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 07:20:08,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 07:20:08,099 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 07:20:08,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 07:20:05" (1/3) ... [2019-09-08 07:20:08,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234fadaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:20:08, skipping insertion in model container [2019-09-08 07:20:08,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 07:20:06" (2/3) ... [2019-09-08 07:20:08,100 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@234fadaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 07:20:08, skipping insertion in model container [2019-09-08 07:20:08,100 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 07:20:08" (3/3) ... [2019-09-08 07:20:08,102 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.4.4.ufo.BOUNDED-8.pals.c [2019-09-08 07:20:08,110 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 07:20:08,119 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 07:20:08,138 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 07:20:08,175 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 07:20:08,176 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 07:20:08,176 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 07:20:08,177 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 07:20:08,177 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 07:20:08,177 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 07:20:08,177 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 07:20:08,177 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 07:20:08,177 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 07:20:08,206 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states. [2019-09-08 07:20:08,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 07:20:08,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:08,222 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, 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 07:20:08,224 INFO L418 AbstractCegarLoop]: === Iteration 1 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:08,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:08,230 INFO L82 PathProgramCache]: Analyzing trace with hash -772559481, now seen corresponding path program 1 times [2019-09-08 07:20:08,232 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:08,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:08,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:08,293 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:08,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:08,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:08,742 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 07:20:08,746 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:08,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:20:08,752 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:20:08,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:20:08,768 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:20:08,770 INFO L87 Difference]: Start difference. First operand 328 states. Second operand 5 states. [2019-09-08 07:20:08,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:08,979 INFO L93 Difference]: Finished difference Result 462 states and 783 transitions. [2019-09-08 07:20:08,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:20:08,980 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2019-09-08 07:20:08,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:09,010 INFO L225 Difference]: With dead ends: 462 [2019-09-08 07:20:09,011 INFO L226 Difference]: Without dead ends: 323 [2019-09-08 07:20:09,018 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:20:09,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2019-09-08 07:20:09,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2019-09-08 07:20:09,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2019-09-08 07:20:09,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 520 transitions. [2019-09-08 07:20:09,087 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 520 transitions. Word has length 98 [2019-09-08 07:20:09,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:09,088 INFO L475 AbstractCegarLoop]: Abstraction has 323 states and 520 transitions. [2019-09-08 07:20:09,088 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:20:09,088 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 520 transitions. [2019-09-08 07:20:09,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-09-08 07:20:09,096 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:09,097 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:20:09,097 INFO L418 AbstractCegarLoop]: === Iteration 2 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:09,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:09,097 INFO L82 PathProgramCache]: Analyzing trace with hash 1532894247, now seen corresponding path program 1 times [2019-09-08 07:20:09,098 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:09,098 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:09,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:09,100 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:09,100 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:09,397 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 07:20:09,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:09,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:20:09,400 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:20:09,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:20:09,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:20:09,401 INFO L87 Difference]: Start difference. First operand 323 states and 520 transitions. Second operand 5 states. [2019-09-08 07:20:10,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:10,767 INFO L93 Difference]: Finished difference Result 574 states and 922 transitions. [2019-09-08 07:20:10,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:20:10,767 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-09-08 07:20:10,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:10,774 INFO L225 Difference]: With dead ends: 574 [2019-09-08 07:20:10,774 INFO L226 Difference]: Without dead ends: 449 [2019-09-08 07:20:10,776 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:20:10,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2019-09-08 07:20:10,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 437. [2019-09-08 07:20:10,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2019-09-08 07:20:10,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 698 transitions. [2019-09-08 07:20:10,815 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 698 transitions. Word has length 139 [2019-09-08 07:20:10,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:10,816 INFO L475 AbstractCegarLoop]: Abstraction has 437 states and 698 transitions. [2019-09-08 07:20:10,816 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:20:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 698 transitions. [2019-09-08 07:20:10,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 07:20:10,821 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:10,821 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:20:10,822 INFO L418 AbstractCegarLoop]: === Iteration 3 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:10,822 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:10,822 INFO L82 PathProgramCache]: Analyzing trace with hash 1125729132, now seen corresponding path program 1 times [2019-09-08 07:20:10,822 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:10,822 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:10,824 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:10,824 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:10,825 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:10,983 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 07:20:10,984 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:10,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:20:10,988 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:20:10,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:20:10,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:20:10,992 INFO L87 Difference]: Start difference. First operand 437 states and 698 transitions. Second operand 5 states. [2019-09-08 07:20:12,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:12,149 INFO L93 Difference]: Finished difference Result 907 states and 1438 transitions. [2019-09-08 07:20:12,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:20:12,154 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-09-08 07:20:12,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:12,159 INFO L225 Difference]: With dead ends: 907 [2019-09-08 07:20:12,159 INFO L226 Difference]: Without dead ends: 668 [2019-09-08 07:20:12,161 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:20:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2019-09-08 07:20:12,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 660. [2019-09-08 07:20:12,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 660 states. [2019-09-08 07:20:12,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 660 states and 1047 transitions. [2019-09-08 07:20:12,200 INFO L78 Accepts]: Start accepts. Automaton has 660 states and 1047 transitions. Word has length 142 [2019-09-08 07:20:12,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:12,201 INFO L475 AbstractCegarLoop]: Abstraction has 660 states and 1047 transitions. [2019-09-08 07:20:12,201 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:20:12,201 INFO L276 IsEmpty]: Start isEmpty. Operand 660 states and 1047 transitions. [2019-09-08 07:20:12,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-09-08 07:20:12,204 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:12,205 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:20:12,205 INFO L418 AbstractCegarLoop]: === Iteration 4 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:12,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:12,206 INFO L82 PathProgramCache]: Analyzing trace with hash 2099911033, now seen corresponding path program 1 times [2019-09-08 07:20:12,206 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:12,206 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:12,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:12,208 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:12,208 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:12,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 07:20:12,379 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:12,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:20:12,381 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:20:12,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:20:12,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:20:12,382 INFO L87 Difference]: Start difference. First operand 660 states and 1047 transitions. Second operand 5 states. [2019-09-08 07:20:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:13,455 INFO L93 Difference]: Finished difference Result 1568 states and 2465 transitions. [2019-09-08 07:20:13,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 07:20:13,456 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 145 [2019-09-08 07:20:13,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:13,465 INFO L225 Difference]: With dead ends: 1568 [2019-09-08 07:20:13,466 INFO L226 Difference]: Without dead ends: 1106 [2019-09-08 07:20:13,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:20:13,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1106 states. [2019-09-08 07:20:13,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1106 to 1092. [2019-09-08 07:20:13,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1092 states. [2019-09-08 07:20:13,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1092 states to 1092 states and 1715 transitions. [2019-09-08 07:20:13,544 INFO L78 Accepts]: Start accepts. Automaton has 1092 states and 1715 transitions. Word has length 145 [2019-09-08 07:20:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:13,545 INFO L475 AbstractCegarLoop]: Abstraction has 1092 states and 1715 transitions. [2019-09-08 07:20:13,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:20:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 1092 states and 1715 transitions. [2019-09-08 07:20:13,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-09-08 07:20:13,550 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:13,551 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:20:13,551 INFO L418 AbstractCegarLoop]: === Iteration 5 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:13,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:13,552 INFO L82 PathProgramCache]: Analyzing trace with hash 624307774, now seen corresponding path program 1 times [2019-09-08 07:20:13,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:13,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:13,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:13,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:13,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:13,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:13,763 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 07:20:13,764 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:13,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:20:13,765 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:20:13,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:20:13,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:20:13,766 INFO L87 Difference]: Start difference. First operand 1092 states and 1715 transitions. Second operand 5 states. [2019-09-08 07:20:14,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:14,952 INFO L93 Difference]: Finished difference Result 2848 states and 4429 transitions. [2019-09-08 07:20:14,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 07:20:14,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 148 [2019-09-08 07:20:14,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:14,969 INFO L225 Difference]: With dead ends: 2848 [2019-09-08 07:20:14,969 INFO L226 Difference]: Without dead ends: 1954 [2019-09-08 07:20:14,974 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:20:14,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2019-09-08 07:20:15,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1928. [2019-09-08 07:20:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1928 states. [2019-09-08 07:20:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1928 states to 1928 states and 2991 transitions. [2019-09-08 07:20:15,150 INFO L78 Accepts]: Start accepts. Automaton has 1928 states and 2991 transitions. Word has length 148 [2019-09-08 07:20:15,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:15,151 INFO L475 AbstractCegarLoop]: Abstraction has 1928 states and 2991 transitions. [2019-09-08 07:20:15,151 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:20:15,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1928 states and 2991 transitions. [2019-09-08 07:20:15,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-09-08 07:20:15,156 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:15,156 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:20:15,156 INFO L418 AbstractCegarLoop]: === Iteration 6 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:15,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:15,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1208811063, now seen corresponding path program 1 times [2019-09-08 07:20:15,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:15,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:15,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:15,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:15,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:15,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:15,516 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 07:20:15,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:15,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:20:15,517 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:20:15,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:20:15,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:20:15,519 INFO L87 Difference]: Start difference. First operand 1928 states and 2991 transitions. Second operand 11 states. [2019-09-08 07:20:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:21,049 INFO L93 Difference]: Finished difference Result 8933 states and 14434 transitions. [2019-09-08 07:20:21,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-09-08 07:20:21,053 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 151 [2019-09-08 07:20:21,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:21,105 INFO L225 Difference]: With dead ends: 8933 [2019-09-08 07:20:21,105 INFO L226 Difference]: Without dead ends: 7203 [2019-09-08 07:20:21,115 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 757 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=512, Invalid=1650, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 07:20:21,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7203 states. [2019-09-08 07:20:21,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7203 to 5621. [2019-09-08 07:20:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5621 states. [2019-09-08 07:20:21,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5621 states to 5621 states and 8805 transitions. [2019-09-08 07:20:21,417 INFO L78 Accepts]: Start accepts. Automaton has 5621 states and 8805 transitions. Word has length 151 [2019-09-08 07:20:21,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:21,417 INFO L475 AbstractCegarLoop]: Abstraction has 5621 states and 8805 transitions. [2019-09-08 07:20:21,417 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:20:21,417 INFO L276 IsEmpty]: Start isEmpty. Operand 5621 states and 8805 transitions. [2019-09-08 07:20:21,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 07:20:21,425 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:21,426 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:20:21,426 INFO L418 AbstractCegarLoop]: === Iteration 7 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:21,426 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:21,426 INFO L82 PathProgramCache]: Analyzing trace with hash -796777300, now seen corresponding path program 1 times [2019-09-08 07:20:21,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:21,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:21,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:21,428 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:21,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:21,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:21,708 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 07:20:21,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:21,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:20:21,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:20:21,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:20:21,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:20:21,710 INFO L87 Difference]: Start difference. First operand 5621 states and 8805 transitions. Second operand 11 states. [2019-09-08 07:20:27,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:27,168 INFO L93 Difference]: Finished difference Result 9856 states and 15725 transitions. [2019-09-08 07:20:27,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-09-08 07:20:27,169 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-09-08 07:20:27,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:27,213 INFO L225 Difference]: With dead ends: 9856 [2019-09-08 07:20:27,214 INFO L226 Difference]: Without dead ends: 8930 [2019-09-08 07:20:27,220 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=486, Invalid=1676, Unknown=0, NotChecked=0, Total=2162 [2019-09-08 07:20:27,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8930 states. [2019-09-08 07:20:27,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8930 to 7528. [2019-09-08 07:20:27,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7528 states. [2019-09-08 07:20:27,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7528 states to 7528 states and 11855 transitions. [2019-09-08 07:20:27,569 INFO L78 Accepts]: Start accepts. Automaton has 7528 states and 11855 transitions. Word has length 152 [2019-09-08 07:20:27,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:27,570 INFO L475 AbstractCegarLoop]: Abstraction has 7528 states and 11855 transitions. [2019-09-08 07:20:27,570 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:20:27,571 INFO L276 IsEmpty]: Start isEmpty. Operand 7528 states and 11855 transitions. [2019-09-08 07:20:27,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 07:20:27,584 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:27,584 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:20:27,585 INFO L418 AbstractCegarLoop]: === Iteration 8 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:27,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:27,585 INFO L82 PathProgramCache]: Analyzing trace with hash -1747849298, now seen corresponding path program 1 times [2019-09-08 07:20:27,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:27,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:27,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:27,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:27,588 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:27,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:27,793 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 07:20:27,794 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:27,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:20:27,795 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:20:27,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:20:27,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:20:27,796 INFO L87 Difference]: Start difference. First operand 7528 states and 11855 transitions. Second operand 6 states. [2019-09-08 07:20:30,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:30,301 INFO L93 Difference]: Finished difference Result 22102 states and 34872 transitions. [2019-09-08 07:20:30,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:20:30,304 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-09-08 07:20:30,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:30,387 INFO L225 Difference]: With dead ends: 22102 [2019-09-08 07:20:30,388 INFO L226 Difference]: Without dead ends: 14772 [2019-09-08 07:20:30,415 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:20:30,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14772 states. [2019-09-08 07:20:31,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14772 to 14640. [2019-09-08 07:20:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14640 states. [2019-09-08 07:20:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14640 states to 14640 states and 22987 transitions. [2019-09-08 07:20:31,099 INFO L78 Accepts]: Start accepts. Automaton has 14640 states and 22987 transitions. Word has length 152 [2019-09-08 07:20:31,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:31,100 INFO L475 AbstractCegarLoop]: Abstraction has 14640 states and 22987 transitions. [2019-09-08 07:20:31,100 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:20:31,100 INFO L276 IsEmpty]: Start isEmpty. Operand 14640 states and 22987 transitions. [2019-09-08 07:20:31,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 07:20:31,112 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:31,113 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:20:31,113 INFO L418 AbstractCegarLoop]: === Iteration 9 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:31,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:31,113 INFO L82 PathProgramCache]: Analyzing trace with hash -963136192, now seen corresponding path program 1 times [2019-09-08 07:20:31,114 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:31,114 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:31,115 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:31,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:31,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:31,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:31,432 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 07:20:31,432 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:31,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:20:31,433 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:20:31,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:20:31,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:20:31,434 INFO L87 Difference]: Start difference. First operand 14640 states and 22987 transitions. Second operand 11 states. [2019-09-08 07:20:40,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:40,704 INFO L93 Difference]: Finished difference Result 30052 states and 47584 transitions. [2019-09-08 07:20:40,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2019-09-08 07:20:40,706 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-09-08 07:20:40,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:40,801 INFO L225 Difference]: With dead ends: 30052 [2019-09-08 07:20:40,802 INFO L226 Difference]: Without dead ends: 22562 [2019-09-08 07:20:40,827 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=612, Invalid=2468, Unknown=0, NotChecked=0, Total=3080 [2019-09-08 07:20:40,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22562 states. [2019-09-08 07:20:41,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22562 to 22154. [2019-09-08 07:20:41,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22154 states. [2019-09-08 07:20:41,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22154 states to 22154 states and 34995 transitions. [2019-09-08 07:20:41,595 INFO L78 Accepts]: Start accepts. Automaton has 22154 states and 34995 transitions. Word has length 152 [2019-09-08 07:20:41,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:41,596 INFO L475 AbstractCegarLoop]: Abstraction has 22154 states and 34995 transitions. [2019-09-08 07:20:41,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:20:41,596 INFO L276 IsEmpty]: Start isEmpty. Operand 22154 states and 34995 transitions. [2019-09-08 07:20:41,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 07:20:41,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:41,608 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:20:41,609 INFO L418 AbstractCegarLoop]: === Iteration 10 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:41,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:41,609 INFO L82 PathProgramCache]: Analyzing trace with hash -106267540, now seen corresponding path program 1 times [2019-09-08 07:20:41,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:41,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:41,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:41,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:41,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:41,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:41,834 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 07:20:41,835 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:41,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:20:41,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:20:41,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:20:41,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:20:41,836 INFO L87 Difference]: Start difference. First operand 22154 states and 34995 transitions. Second operand 11 states. [2019-09-08 07:20:49,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:20:49,868 INFO L93 Difference]: Finished difference Result 38389 states and 60751 transitions. [2019-09-08 07:20:49,869 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-09-08 07:20:49,869 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-09-08 07:20:49,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:20:49,986 INFO L225 Difference]: With dead ends: 38389 [2019-09-08 07:20:49,986 INFO L226 Difference]: Without dead ends: 29822 [2019-09-08 07:20:50,021 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1026 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=599, Invalid=2371, Unknown=0, NotChecked=0, Total=2970 [2019-09-08 07:20:50,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29822 states. [2019-09-08 07:20:51,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29822 to 29586. [2019-09-08 07:20:51,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29586 states. [2019-09-08 07:20:51,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29586 states to 29586 states and 46902 transitions. [2019-09-08 07:20:51,066 INFO L78 Accepts]: Start accepts. Automaton has 29586 states and 46902 transitions. Word has length 152 [2019-09-08 07:20:51,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:20:51,066 INFO L475 AbstractCegarLoop]: Abstraction has 29586 states and 46902 transitions. [2019-09-08 07:20:51,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:20:51,067 INFO L276 IsEmpty]: Start isEmpty. Operand 29586 states and 46902 transitions. [2019-09-08 07:20:51,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 07:20:51,079 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:20:51,080 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:20:51,080 INFO L418 AbstractCegarLoop]: === Iteration 11 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:20:51,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:20:51,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1311271810, now seen corresponding path program 1 times [2019-09-08 07:20:51,080 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:20:51,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:20:51,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:51,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:20:51,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:20:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:20:51,354 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 07:20:51,355 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:20:51,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2019-09-08 07:20:51,355 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-09-08 07:20:51,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-09-08 07:20:51,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:20:51,356 INFO L87 Difference]: Start difference. First operand 29586 states and 46902 transitions. Second operand 11 states. [2019-09-08 07:21:00,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:21:00,165 INFO L93 Difference]: Finished difference Result 44945 states and 71345 transitions. [2019-09-08 07:21:00,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2019-09-08 07:21:00,166 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2019-09-08 07:21:00,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:21:00,274 INFO L225 Difference]: With dead ends: 44945 [2019-09-08 07:21:00,275 INFO L226 Difference]: Without dead ends: 34251 [2019-09-08 07:21:00,307 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1024 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=585, Invalid=2277, Unknown=0, NotChecked=0, Total=2862 [2019-09-08 07:21:00,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34251 states. [2019-09-08 07:21:01,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34251 to 34135. [2019-09-08 07:21:01,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34135 states. [2019-09-08 07:21:01,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34135 states to 34135 states and 54171 transitions. [2019-09-08 07:21:01,441 INFO L78 Accepts]: Start accepts. Automaton has 34135 states and 54171 transitions. Word has length 152 [2019-09-08 07:21:01,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:21:01,442 INFO L475 AbstractCegarLoop]: Abstraction has 34135 states and 54171 transitions. [2019-09-08 07:21:01,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-09-08 07:21:01,442 INFO L276 IsEmpty]: Start isEmpty. Operand 34135 states and 54171 transitions. [2019-09-08 07:21:01,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 07:21:01,452 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:21:01,453 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:21:01,453 INFO L418 AbstractCegarLoop]: === Iteration 12 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:21:01,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:21:01,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1859704533, now seen corresponding path program 1 times [2019-09-08 07:21:01,453 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:21:01,454 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:21:01,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:01,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:21:01,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:01,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:21:01,709 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 07:21:01,709 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:21:01,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 07:21:01,710 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 07:21:01,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 07:21:01,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:21:01,711 INFO L87 Difference]: Start difference. First operand 34135 states and 54171 transitions. Second operand 12 states. [2019-09-08 07:21:07,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:21:07,293 INFO L93 Difference]: Finished difference Result 47674 states and 75686 transitions. [2019-09-08 07:21:07,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-09-08 07:21:07,293 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 153 [2019-09-08 07:21:07,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:21:07,393 INFO L225 Difference]: With dead ends: 47674 [2019-09-08 07:21:07,393 INFO L226 Difference]: Without dead ends: 35147 [2019-09-08 07:21:07,425 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=411, Invalid=1149, Unknown=0, NotChecked=0, Total=1560 [2019-09-08 07:21:07,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35147 states. [2019-09-08 07:21:08,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35147 to 35067. [2019-09-08 07:21:08,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35067 states. [2019-09-08 07:21:08,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35067 states to 35067 states and 55639 transitions. [2019-09-08 07:21:08,529 INFO L78 Accepts]: Start accepts. Automaton has 35067 states and 55639 transitions. Word has length 153 [2019-09-08 07:21:08,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:21:08,530 INFO L475 AbstractCegarLoop]: Abstraction has 35067 states and 55639 transitions. [2019-09-08 07:21:08,530 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 07:21:08,530 INFO L276 IsEmpty]: Start isEmpty. Operand 35067 states and 55639 transitions. [2019-09-08 07:21:08,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 07:21:08,540 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:21:08,540 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:21:08,541 INFO L418 AbstractCegarLoop]: === Iteration 13 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:21:08,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:21:08,541 INFO L82 PathProgramCache]: Analyzing trace with hash -1074991427, now seen corresponding path program 1 times [2019-09-08 07:21:08,541 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:21:08,541 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:21:08,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:08,543 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:21:08,543 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:08,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:21:08,708 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 07:21:08,708 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:21:08,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:21:08,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:21:08,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:21:08,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:21:08,710 INFO L87 Difference]: Start difference. First operand 35067 states and 55639 transitions. Second operand 6 states. [2019-09-08 07:21:11,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:21:11,494 INFO L93 Difference]: Finished difference Result 63858 states and 101346 transitions. [2019-09-08 07:21:11,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:21:11,495 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-09-08 07:21:11,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:21:11,640 INFO L225 Difference]: With dead ends: 63858 [2019-09-08 07:21:11,641 INFO L226 Difference]: Without dead ends: 37469 [2019-09-08 07:21:11,701 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:21:11,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37469 states. [2019-09-08 07:21:13,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37469 to 35145. [2019-09-08 07:21:13,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35145 states. [2019-09-08 07:21:13,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35145 states to 35145 states and 55639 transitions. [2019-09-08 07:21:13,300 INFO L78 Accepts]: Start accepts. Automaton has 35145 states and 55639 transitions. Word has length 153 [2019-09-08 07:21:13,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:21:13,301 INFO L475 AbstractCegarLoop]: Abstraction has 35145 states and 55639 transitions. [2019-09-08 07:21:13,301 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:21:13,301 INFO L276 IsEmpty]: Start isEmpty. Operand 35145 states and 55639 transitions. [2019-09-08 07:21:13,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 07:21:13,317 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:21:13,317 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:21:13,317 INFO L418 AbstractCegarLoop]: === Iteration 14 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:21:13,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:21:13,318 INFO L82 PathProgramCache]: Analyzing trace with hash -218122775, now seen corresponding path program 1 times [2019-09-08 07:21:13,318 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:21:13,318 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:21:13,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:13,321 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:21:13,321 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:13,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:21:13,583 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 07:21:13,583 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:21:13,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:21:13,584 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:21:13,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:21:13,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:21:13,585 INFO L87 Difference]: Start difference. First operand 35145 states and 55639 transitions. Second operand 6 states. [2019-09-08 07:21:16,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:21:16,590 INFO L93 Difference]: Finished difference Result 65196 states and 105645 transitions. [2019-09-08 07:21:16,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:21:16,591 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-09-08 07:21:16,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:21:16,710 INFO L225 Difference]: With dead ends: 65196 [2019-09-08 07:21:16,711 INFO L226 Difference]: Without dead ends: 39981 [2019-09-08 07:21:16,753 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:21:16,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39981 states. [2019-09-08 07:21:17,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39981 to 35724. [2019-09-08 07:21:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35724 states. [2019-09-08 07:21:18,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35724 states to 35724 states and 56522 transitions. [2019-09-08 07:21:18,024 INFO L78 Accepts]: Start accepts. Automaton has 35724 states and 56522 transitions. Word has length 153 [2019-09-08 07:21:18,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:21:18,025 INFO L475 AbstractCegarLoop]: Abstraction has 35724 states and 56522 transitions. [2019-09-08 07:21:18,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:21:18,025 INFO L276 IsEmpty]: Start isEmpty. Operand 35724 states and 56522 transitions. [2019-09-08 07:21:18,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 07:21:18,029 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:21:18,029 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:21:18,030 INFO L418 AbstractCegarLoop]: === Iteration 15 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:21:18,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:21:18,030 INFO L82 PathProgramCache]: Analyzing trace with hash -1329850336, now seen corresponding path program 1 times [2019-09-08 07:21:18,030 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:21:18,030 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:21:18,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:18,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:21:18,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:18,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:21:18,182 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 07:21:18,183 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:21:18,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:21:18,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:21:18,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:21:18,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:21:18,184 INFO L87 Difference]: Start difference. First operand 35724 states and 56522 transitions. Second operand 6 states. [2019-09-08 07:21:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:21:21,718 INFO L93 Difference]: Finished difference Result 107549 states and 170695 transitions. [2019-09-08 07:21:21,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:21:21,718 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-09-08 07:21:21,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:21:21,901 INFO L225 Difference]: With dead ends: 107549 [2019-09-08 07:21:21,902 INFO L226 Difference]: Without dead ends: 72023 [2019-09-08 07:21:21,957 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:21:22,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72023 states. [2019-09-08 07:21:24,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72023 to 55775. [2019-09-08 07:21:24,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55775 states. [2019-09-08 07:21:24,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55775 states to 55775 states and 88243 transitions. [2019-09-08 07:21:24,919 INFO L78 Accepts]: Start accepts. Automaton has 55775 states and 88243 transitions. Word has length 153 [2019-09-08 07:21:24,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:21:24,920 INFO L475 AbstractCegarLoop]: Abstraction has 55775 states and 88243 transitions. [2019-09-08 07:21:24,920 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:21:24,920 INFO L276 IsEmpty]: Start isEmpty. Operand 55775 states and 88243 transitions. [2019-09-08 07:21:24,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-09-08 07:21:24,925 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:21:24,925 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:21:24,926 INFO L418 AbstractCegarLoop]: === Iteration 16 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:21:24,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:21:24,926 INFO L82 PathProgramCache]: Analyzing trace with hash 1012416599, now seen corresponding path program 1 times [2019-09-08 07:21:24,926 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:21:24,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:21:24,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:24,928 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:21:24,928 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:25,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:21:25,147 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 07:21:25,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:21:25,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:21:25,148 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:21:25,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:21:25,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:21:25,149 INFO L87 Difference]: Start difference. First operand 55775 states and 88243 transitions. Second operand 6 states. [2019-09-08 07:21:28,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:21:28,631 INFO L93 Difference]: Finished difference Result 98048 states and 158765 transitions. [2019-09-08 07:21:28,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:21:28,632 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 153 [2019-09-08 07:21:28,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:21:28,838 INFO L225 Difference]: With dead ends: 98048 [2019-09-08 07:21:28,838 INFO L226 Difference]: Without dead ends: 62341 [2019-09-08 07:21:28,895 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2019-09-08 07:21:28,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62341 states. [2019-09-08 07:21:32,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62341 to 56463. [2019-09-08 07:21:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56463 states. [2019-09-08 07:21:32,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56463 states to 56463 states and 89275 transitions. [2019-09-08 07:21:32,465 INFO L78 Accepts]: Start accepts. Automaton has 56463 states and 89275 transitions. Word has length 153 [2019-09-08 07:21:32,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:21:32,466 INFO L475 AbstractCegarLoop]: Abstraction has 56463 states and 89275 transitions. [2019-09-08 07:21:32,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:21:32,466 INFO L276 IsEmpty]: Start isEmpty. Operand 56463 states and 89275 transitions. [2019-09-08 07:21:32,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2019-09-08 07:21:32,470 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:21:32,470 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:21:32,470 INFO L418 AbstractCegarLoop]: === Iteration 17 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:21:32,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:21:32,471 INFO L82 PathProgramCache]: Analyzing trace with hash -1308469339, now seen corresponding path program 1 times [2019-09-08 07:21:32,471 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:21:32,471 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:21:32,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:32,472 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:21:32,472 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:32,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:21:32,628 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 07:21:32,629 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:21:32,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:21:32,629 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:21:32,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:21:32,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:21:32,630 INFO L87 Difference]: Start difference. First operand 56463 states and 89275 transitions. Second operand 6 states. [2019-09-08 07:21:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:21:36,365 INFO L93 Difference]: Finished difference Result 130889 states and 206562 transitions. [2019-09-08 07:21:36,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:21:36,365 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 154 [2019-09-08 07:21:36,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:21:36,559 INFO L225 Difference]: With dead ends: 130889 [2019-09-08 07:21:36,560 INFO L226 Difference]: Without dead ends: 74624 [2019-09-08 07:21:36,639 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:21:36,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74624 states. [2019-09-08 07:21:40,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74624 to 73756. [2019-09-08 07:21:40,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73756 states. [2019-09-08 07:21:41,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73756 states to 73756 states and 116447 transitions. [2019-09-08 07:21:41,120 INFO L78 Accepts]: Start accepts. Automaton has 73756 states and 116447 transitions. Word has length 154 [2019-09-08 07:21:41,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:21:41,121 INFO L475 AbstractCegarLoop]: Abstraction has 73756 states and 116447 transitions. [2019-09-08 07:21:41,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:21:41,121 INFO L276 IsEmpty]: Start isEmpty. Operand 73756 states and 116447 transitions. [2019-09-08 07:21:41,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 07:21:41,125 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:21:41,125 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:21:41,125 INFO L418 AbstractCegarLoop]: === Iteration 18 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:21:41,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:21:41,126 INFO L82 PathProgramCache]: Analyzing trace with hash -697343369, now seen corresponding path program 1 times [2019-09-08 07:21:41,126 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:21:41,126 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:21:41,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:41,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:21:41,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:41,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:21:41,293 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 07:21:41,293 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:21:41,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 07:21:41,294 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 07:21:41,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 07:21:41,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-09-08 07:21:41,294 INFO L87 Difference]: Start difference. First operand 73756 states and 116447 transitions. Second operand 6 states. [2019-09-08 07:21:47,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:21:47,092 INFO L93 Difference]: Finished difference Result 222357 states and 352349 transitions. [2019-09-08 07:21:47,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 07:21:47,093 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 155 [2019-09-08 07:21:47,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:21:47,511 INFO L225 Difference]: With dead ends: 222357 [2019-09-08 07:21:47,511 INFO L226 Difference]: Without dead ends: 148799 [2019-09-08 07:21:47,611 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-09-08 07:21:47,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148799 states. [2019-09-08 07:21:53,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148799 to 111469. [2019-09-08 07:21:53,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111469 states. [2019-09-08 07:21:54,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111469 states to 111469 states and 176124 transitions. [2019-09-08 07:21:54,053 INFO L78 Accepts]: Start accepts. Automaton has 111469 states and 176124 transitions. Word has length 155 [2019-09-08 07:21:54,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:21:54,054 INFO L475 AbstractCegarLoop]: Abstraction has 111469 states and 176124 transitions. [2019-09-08 07:21:54,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 07:21:54,055 INFO L276 IsEmpty]: Start isEmpty. Operand 111469 states and 176124 transitions. [2019-09-08 07:21:54,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 07:21:54,058 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:21:54,058 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:21:54,058 INFO L418 AbstractCegarLoop]: === Iteration 19 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:21:54,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:21:54,058 INFO L82 PathProgramCache]: Analyzing trace with hash 950711842, now seen corresponding path program 1 times [2019-09-08 07:21:54,059 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:21:54,059 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:21:54,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:54,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:21:54,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:21:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:21:54,305 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 07:21:54,305 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:21:54,305 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-09-08 07:21:54,306 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-09-08 07:21:54,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-09-08 07:21:54,306 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2019-09-08 07:21:54,306 INFO L87 Difference]: Start difference. First operand 111469 states and 176124 transitions. Second operand 12 states. [2019-09-08 07:22:08,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:22:08,185 INFO L93 Difference]: Finished difference Result 199695 states and 319552 transitions. [2019-09-08 07:22:08,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-09-08 07:22:08,186 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 155 [2019-09-08 07:22:08,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:22:08,686 INFO L225 Difference]: With dead ends: 199695 [2019-09-08 07:22:08,686 INFO L226 Difference]: Without dead ends: 170049 [2019-09-08 07:22:08,777 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 823 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=598, Invalid=1952, Unknown=0, NotChecked=0, Total=2550 [2019-09-08 07:22:08,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170049 states. [2019-09-08 07:22:14,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170049 to 151635. [2019-09-08 07:22:14,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151635 states. [2019-09-08 07:22:14,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151635 states to 151635 states and 240704 transitions. [2019-09-08 07:22:14,608 INFO L78 Accepts]: Start accepts. Automaton has 151635 states and 240704 transitions. Word has length 155 [2019-09-08 07:22:14,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:22:14,609 INFO L475 AbstractCegarLoop]: Abstraction has 151635 states and 240704 transitions. [2019-09-08 07:22:14,609 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-09-08 07:22:14,609 INFO L276 IsEmpty]: Start isEmpty. Operand 151635 states and 240704 transitions. [2019-09-08 07:22:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2019-09-08 07:22:14,611 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:22:14,612 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:22:14,612 INFO L418 AbstractCegarLoop]: === Iteration 20 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:22:14,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:22:14,612 INFO L82 PathProgramCache]: Analyzing trace with hash 441238752, now seen corresponding path program 1 times [2019-09-08 07:22:14,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:22:14,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:22:14,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:22:14,613 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:22:14,613 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:22:14,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:22:14,779 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 07:22:14,779 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:22:14,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 07:22:14,780 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 07:22:14,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 07:22:14,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:22:14,780 INFO L87 Difference]: Start difference. First operand 151635 states and 240704 transitions. Second operand 7 states. [2019-09-08 07:22:25,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:22:25,481 INFO L93 Difference]: Finished difference Result 274943 states and 437408 transitions. [2019-09-08 07:22:25,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-09-08 07:22:25,482 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 155 [2019-09-08 07:22:25,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:22:26,181 INFO L225 Difference]: With dead ends: 274943 [2019-09-08 07:22:26,181 INFO L226 Difference]: Without dead ends: 197708 [2019-09-08 07:22:26,316 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2019-09-08 07:22:26,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197708 states. [2019-09-08 07:22:33,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197708 to 197320. [2019-09-08 07:22:33,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197320 states. [2019-09-08 07:22:34,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197320 states to 197320 states and 313857 transitions. [2019-09-08 07:22:34,217 INFO L78 Accepts]: Start accepts. Automaton has 197320 states and 313857 transitions. Word has length 155 [2019-09-08 07:22:34,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:22:34,218 INFO L475 AbstractCegarLoop]: Abstraction has 197320 states and 313857 transitions. [2019-09-08 07:22:34,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 07:22:34,218 INFO L276 IsEmpty]: Start isEmpty. Operand 197320 states and 313857 transitions. [2019-09-08 07:22:34,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 07:22:34,221 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:22:34,221 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:22:34,221 INFO L418 AbstractCegarLoop]: === Iteration 21 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:22:34,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:22:34,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1018171407, now seen corresponding path program 1 times [2019-09-08 07:22:34,221 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:22:34,222 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:22:34,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:22:34,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:22:34,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:22:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:22:34,517 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 07:22:34,517 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:22:34,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:22:34,518 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:22:34,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:22:34,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:22:34,519 INFO L87 Difference]: Start difference. First operand 197320 states and 313857 transitions. Second operand 5 states. [2019-09-08 07:22:50,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:22:50,592 INFO L93 Difference]: Finished difference Result 587016 states and 945398 transitions. [2019-09-08 07:22:50,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:22:50,593 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-08 07:22:50,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:22:51,712 INFO L225 Difference]: With dead ends: 587016 [2019-09-08 07:22:51,712 INFO L226 Difference]: Without dead ends: 389730 [2019-09-08 07:22:52,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:22:52,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389730 states. [2019-09-08 07:23:17,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389730 to 389728. [2019-09-08 07:23:17,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389728 states. [2019-09-08 07:23:18,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389728 states to 389728 states and 613040 transitions. [2019-09-08 07:23:18,457 INFO L78 Accepts]: Start accepts. Automaton has 389728 states and 613040 transitions. Word has length 157 [2019-09-08 07:23:18,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:23:18,458 INFO L475 AbstractCegarLoop]: Abstraction has 389728 states and 613040 transitions. [2019-09-08 07:23:18,458 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:23:18,458 INFO L276 IsEmpty]: Start isEmpty. Operand 389728 states and 613040 transitions. [2019-09-08 07:23:18,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-08 07:23:18,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:23:18,463 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:23:18,463 INFO L418 AbstractCegarLoop]: === Iteration 22 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:23:18,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:23:18,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1250405517, now seen corresponding path program 1 times [2019-09-08 07:23:18,463 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:23:18,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:23:18,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:23:18,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:23:18,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:23:18,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:23:18,713 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 07:23:18,714 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:23:18,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 07:23:18,715 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 07:23:18,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 07:23:18,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 07:23:18,716 INFO L87 Difference]: Start difference. First operand 389728 states and 613040 transitions. Second operand 5 states. [2019-09-08 07:24:00,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:24:00,247 INFO L93 Difference]: Finished difference Result 1159449 states and 1844785 transitions. [2019-09-08 07:24:00,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 07:24:00,248 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 157 [2019-09-08 07:24:00,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:24:02,658 INFO L225 Difference]: With dead ends: 1159449 [2019-09-08 07:24:02,658 INFO L226 Difference]: Without dead ends: 769737 [2019-09-08 07:24:03,357 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 07:24:04,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 769737 states. [2019-09-08 07:24:54,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 769737 to 769735. [2019-09-08 07:24:54,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769735 states. [2019-09-08 07:24:56,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769735 states to 769735 states and 1196875 transitions. [2019-09-08 07:24:56,918 INFO L78 Accepts]: Start accepts. Automaton has 769735 states and 1196875 transitions. Word has length 157 [2019-09-08 07:24:56,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:24:56,918 INFO L475 AbstractCegarLoop]: Abstraction has 769735 states and 1196875 transitions. [2019-09-08 07:24:56,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 07:24:56,919 INFO L276 IsEmpty]: Start isEmpty. Operand 769735 states and 1196875 transitions. [2019-09-08 07:24:56,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 07:24:56,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:24:56,931 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:24:56,931 INFO L418 AbstractCegarLoop]: === Iteration 23 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:24:56,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:24:56,931 INFO L82 PathProgramCache]: Analyzing trace with hash 388898933, now seen corresponding path program 1 times [2019-09-08 07:24:56,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:24:56,932 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:24:56,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:24:56,933 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:24:56,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:24:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:24:57,202 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 07:24:57,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:24:57,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2019-09-08 07:24:57,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-09-08 07:24:57,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-09-08 07:24:57,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2019-09-08 07:24:57,204 INFO L87 Difference]: Start difference. First operand 769735 states and 1196875 transitions. Second operand 16 states. [2019-09-08 07:25:46,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:25:46,371 INFO L93 Difference]: Finished difference Result 1082447 states and 1684728 transitions. [2019-09-08 07:25:46,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-09-08 07:25:46,371 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 159 [2019-09-08 07:25:46,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:25:49,157 INFO L225 Difference]: With dead ends: 1082447 [2019-09-08 07:25:49,157 INFO L226 Difference]: Without dead ends: 942507 [2019-09-08 07:25:49,514 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=267, Invalid=993, Unknown=0, NotChecked=0, Total=1260 [2019-09-08 07:25:50,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942507 states. [2019-09-08 07:26:52,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942507 to 770221. [2019-09-08 07:26:52,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 770221 states. [2019-09-08 07:26:55,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770221 states to 770221 states and 1197582 transitions. [2019-09-08 07:26:55,036 INFO L78 Accepts]: Start accepts. Automaton has 770221 states and 1197582 transitions. Word has length 159 [2019-09-08 07:26:55,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:26:55,037 INFO L475 AbstractCegarLoop]: Abstraction has 770221 states and 1197582 transitions. [2019-09-08 07:26:55,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-09-08 07:26:55,037 INFO L276 IsEmpty]: Start isEmpty. Operand 770221 states and 1197582 transitions. [2019-09-08 07:26:55,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 07:26:55,050 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:26:55,050 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:26:55,050 INFO L418 AbstractCegarLoop]: === Iteration 24 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:26:55,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:26:55,051 INFO L82 PathProgramCache]: Analyzing trace with hash -508494345, now seen corresponding path program 1 times [2019-09-08 07:26:55,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:26:55,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:26:55,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:26:55,052 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:26:55,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:26:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:26:55,209 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 07:26:55,209 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:26:55,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:26:55,210 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:26:55,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:26:55,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:26:55,211 INFO L87 Difference]: Start difference. First operand 770221 states and 1197582 transitions. Second operand 10 states. [2019-09-08 07:27:55,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 07:27:55,686 INFO L93 Difference]: Finished difference Result 1412477 states and 2208843 transitions. [2019-09-08 07:27:55,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-09-08 07:27:55,687 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 159 [2019-09-08 07:27:55,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 07:27:58,492 INFO L225 Difference]: With dead ends: 1412477 [2019-09-08 07:27:58,492 INFO L226 Difference]: Without dead ends: 1072298 [2019-09-08 07:27:59,848 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2019-09-08 07:28:00,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072298 states. [2019-09-08 07:28:57,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072298 to 793434. [2019-09-08 07:28:57,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 793434 states. [2019-09-08 07:29:14,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 793434 states to 793434 states and 1234545 transitions. [2019-09-08 07:29:14,814 INFO L78 Accepts]: Start accepts. Automaton has 793434 states and 1234545 transitions. Word has length 159 [2019-09-08 07:29:14,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 07:29:14,815 INFO L475 AbstractCegarLoop]: Abstraction has 793434 states and 1234545 transitions. [2019-09-08 07:29:14,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-08 07:29:14,815 INFO L276 IsEmpty]: Start isEmpty. Operand 793434 states and 1234545 transitions. [2019-09-08 07:29:14,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-08 07:29:14,827 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 07:29:14,827 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 07:29:14,828 INFO L418 AbstractCegarLoop]: === Iteration 25 === [assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 07:29:14,828 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 07:29:14,828 INFO L82 PathProgramCache]: Analyzing trace with hash 832799607, now seen corresponding path program 1 times [2019-09-08 07:29:14,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 07:29:14,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 07:29:14,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:29:14,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 07:29:14,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 07:29:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 07:29:15,005 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 07:29:15,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 07:29:15,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-08 07:29:15,006 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-08 07:29:15,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-08 07:29:15,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-08 07:29:15,007 INFO L87 Difference]: Start difference. First operand 793434 states and 1234545 transitions. Second operand 10 states.