java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 09:32:16,466 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 09:32:16,468 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 09:32:16,480 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 09:32:16,480 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 09:32:16,481 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 09:32:16,483 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 09:32:16,484 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 09:32:16,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 09:32:16,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 09:32:16,488 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 09:32:16,489 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 09:32:16,489 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 09:32:16,490 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 09:32:16,491 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 09:32:16,492 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 09:32:16,493 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 09:32:16,494 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 09:32:16,496 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 09:32:16,498 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 09:32:16,500 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 09:32:16,501 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 09:32:16,502 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 09:32:16,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 09:32:16,510 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 09:32:16,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 09:32:16,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 09:32:16,514 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 09:32:16,516 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 09:32:16,517 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 09:32:16,518 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 09:32:16,521 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 09:32:16,522 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 09:32:16,523 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 09:32:16,524 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 09:32:16,524 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 09:32:16,525 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 09:32:16,525 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 09:32:16,525 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 09:32:16,529 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 09:32:16,530 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 09:32:16,531 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 09:32:16,558 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 09:32:16,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 09:32:16,563 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 09:32:16,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 09:32:16,563 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 09:32:16,564 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 09:32:16,564 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 09:32:16,565 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 09:32:16,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 09:32:16,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 09:32:16,565 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 09:32:16,566 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 09:32:16,566 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 09:32:16,566 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 09:32:16,566 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 09:32:16,566 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 09:32:16,567 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 09:32:16,567 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 09:32:16,567 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 09:32:16,568 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 09:32:16,569 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 09:32:16,569 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 09:32:16,569 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 09:32:16,570 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 09:32:16,570 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 09:32:16,570 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 09:32:16,571 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 09:32:16,571 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 09:32:16,571 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 09:32:16,627 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 09:32:16,645 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 09:32:16,649 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 09:32:16,651 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 09:32:16,652 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 09:32:16,653 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 09:32:16,721 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c22f5101/2ce50ecdd2d5486999e3aedacee4f4a7/FLAG2f99a082f [2019-09-08 09:32:17,184 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 09:32:17,185 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/seq-mthreaded-reduced/pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 09:32:17,197 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c22f5101/2ce50ecdd2d5486999e3aedacee4f4a7/FLAG2f99a082f [2019-09-08 09:32:17,566 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c22f5101/2ce50ecdd2d5486999e3aedacee4f4a7 [2019-09-08 09:32:17,577 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 09:32:17,579 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 09:32:17,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 09:32:17,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 09:32:17,584 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 09:32:17,585 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:32:17" (1/1) ... [2019-09-08 09:32:17,587 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23b28937 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:32:17, skipping insertion in model container [2019-09-08 09:32:17,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 09:32:17" (1/1) ... [2019-09-08 09:32:17,594 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 09:32:17,654 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 09:32:18,018 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:32:18,033 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 09:32:18,139 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 09:32:18,168 INFO L192 MainTranslator]: Completed translation [2019-09-08 09:32:18,169 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:32:18 WrapperNode [2019-09-08 09:32:18,169 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 09:32:18,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 09:32:18,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 09:32:18,170 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 09:32:18,181 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:32:18" (1/1) ... [2019-09-08 09:32:18,181 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:32:18" (1/1) ... [2019-09-08 09:32:18,192 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:32:18" (1/1) ... [2019-09-08 09:32:18,192 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:32:18" (1/1) ... [2019-09-08 09:32:18,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:32:18" (1/1) ... [2019-09-08 09:32:18,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:32:18" (1/1) ... [2019-09-08 09:32:18,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:32:18" (1/1) ... [2019-09-08 09:32:18,228 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 09:32:18,229 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 09:32:18,229 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 09:32:18,229 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 09:32:18,232 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:32:18" (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 09:32:18,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 09:32:18,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 09:32:18,290 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 09:32:18,290 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 09:32:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-09-08 09:32:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_bool [2019-09-08 09:32:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure assert [2019-09-08 09:32:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-08 09:32:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure read [2019-09-08 09:32:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure write [2019-09-08 09:32:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure node1 [2019-09-08 09:32:18,291 INFO L130 BoogieDeclarations]: Found specification of procedure node2 [2019-09-08 09:32:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure node3 [2019-09-08 09:32:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure init [2019-09-08 09:32:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure check [2019-09-08 09:32:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 09:32:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 09:32:18,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 09:32:19,069 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 09:32:19,069 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 09:32:19,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:32:19 BoogieIcfgContainer [2019-09-08 09:32:19,071 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 09:32:19,072 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 09:32:19,072 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 09:32:19,075 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 09:32:19,076 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 09:32:17" (1/3) ... [2019-09-08 09:32:19,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754f4469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:32:19, skipping insertion in model container [2019-09-08 09:32:19,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 09:32:18" (2/3) ... [2019-09-08 09:32:19,077 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754f4469 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 09:32:19, skipping insertion in model container [2019-09-08 09:32:19,077 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 09:32:19" (3/3) ... [2019-09-08 09:32:19,079 INFO L109 eAbstractionObserver]: Analyzing ICFG pals_floodmax.3.4.ufo.BOUNDED-6.pals.c.v+cfa-reducer.c [2019-09-08 09:32:19,089 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 09:32:19,102 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 09:32:19,120 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 09:32:19,166 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 09:32:19,167 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 09:32:19,168 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 09:32:19,168 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 09:32:19,168 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 09:32:19,169 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 09:32:19,169 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 09:32:19,169 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 09:32:19,169 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 09:32:19,195 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states. [2019-09-08 09:32:19,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2019-09-08 09:32:19,207 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:19,208 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] [2019-09-08 09:32:19,210 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:19,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:19,216 INFO L82 PathProgramCache]: Analyzing trace with hash 8502252, now seen corresponding path program 1 times [2019-09-08 09:32:19,218 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:19,218 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:19,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:19,276 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:19,276 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:19,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:19,674 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 09:32:19,676 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:19,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:32:19,684 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:32:19,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:32:19,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:32:19,701 INFO L87 Difference]: Start difference. First operand 140 states. Second operand 3 states. [2019-09-08 09:32:19,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:19,866 INFO L93 Difference]: Finished difference Result 285 states and 482 transitions. [2019-09-08 09:32:19,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:32:19,868 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 61 [2019-09-08 09:32:19,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:19,892 INFO L225 Difference]: With dead ends: 285 [2019-09-08 09:32:19,892 INFO L226 Difference]: Without dead ends: 195 [2019-09-08 09:32:19,896 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:32:19,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2019-09-08 09:32:19,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2019-09-08 09:32:19,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2019-09-08 09:32:19,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 301 transitions. [2019-09-08 09:32:19,957 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 301 transitions. Word has length 61 [2019-09-08 09:32:19,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:19,958 INFO L475 AbstractCegarLoop]: Abstraction has 193 states and 301 transitions. [2019-09-08 09:32:19,958 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:32:19,959 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 301 transitions. [2019-09-08 09:32:19,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-09-08 09:32:19,962 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:19,962 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] [2019-09-08 09:32:19,963 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:19,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:19,963 INFO L82 PathProgramCache]: Analyzing trace with hash -851487175, now seen corresponding path program 1 times [2019-09-08 09:32:19,963 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:19,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:19,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:19,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:19,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:20,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:20,148 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 09:32:20,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:20,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:32:20,151 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:32:20,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:32:20,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:32:20,152 INFO L87 Difference]: Start difference. First operand 193 states and 301 transitions. Second operand 3 states. [2019-09-08 09:32:20,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:20,236 INFO L93 Difference]: Finished difference Result 449 states and 725 transitions. [2019-09-08 09:32:20,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:32:20,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 63 [2019-09-08 09:32:20,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:20,243 INFO L225 Difference]: With dead ends: 449 [2019-09-08 09:32:20,243 INFO L226 Difference]: Without dead ends: 314 [2019-09-08 09:32:20,246 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:32:20,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2019-09-08 09:32:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2019-09-08 09:32:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2019-09-08 09:32:20,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 497 transitions. [2019-09-08 09:32:20,301 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 497 transitions. Word has length 63 [2019-09-08 09:32:20,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:20,301 INFO L475 AbstractCegarLoop]: Abstraction has 312 states and 497 transitions. [2019-09-08 09:32:20,302 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:32:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 497 transitions. [2019-09-08 09:32:20,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 09:32:20,305 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:20,306 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] [2019-09-08 09:32:20,306 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:20,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:20,306 INFO L82 PathProgramCache]: Analyzing trace with hash 812724513, now seen corresponding path program 1 times [2019-09-08 09:32:20,306 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:20,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:20,308 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:20,309 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:20,309 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:20,407 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 09:32:20,407 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:20,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:32:20,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:32:20,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:32:20,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:32:20,410 INFO L87 Difference]: Start difference. First operand 312 states and 497 transitions. Second operand 3 states. [2019-09-08 09:32:20,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:20,470 INFO L93 Difference]: Finished difference Result 567 states and 921 transitions. [2019-09-08 09:32:20,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:32:20,471 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-08 09:32:20,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:20,474 INFO L225 Difference]: With dead ends: 567 [2019-09-08 09:32:20,475 INFO L226 Difference]: Without dead ends: 432 [2019-09-08 09:32:20,476 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:32:20,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2019-09-08 09:32:20,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 430. [2019-09-08 09:32:20,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 430 states. [2019-09-08 09:32:20,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 691 transitions. [2019-09-08 09:32:20,510 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 691 transitions. Word has length 65 [2019-09-08 09:32:20,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:20,510 INFO L475 AbstractCegarLoop]: Abstraction has 430 states and 691 transitions. [2019-09-08 09:32:20,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:32:20,511 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 691 transitions. [2019-09-08 09:32:20,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-09-08 09:32:20,513 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:20,514 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] [2019-09-08 09:32:20,514 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:20,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:20,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1750058316, now seen corresponding path program 1 times [2019-09-08 09:32:20,515 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:20,515 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:20,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:20,516 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:20,516 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:20,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:20,649 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 09:32:20,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:20,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:32:20,650 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:32:20,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:32:20,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:32:20,651 INFO L87 Difference]: Start difference. First operand 430 states and 691 transitions. Second operand 3 states. [2019-09-08 09:32:20,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:20,702 INFO L93 Difference]: Finished difference Result 1086 states and 1771 transitions. [2019-09-08 09:32:20,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:32:20,702 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-09-08 09:32:20,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:20,708 INFO L225 Difference]: With dead ends: 1086 [2019-09-08 09:32:20,708 INFO L226 Difference]: Without dead ends: 737 [2019-09-08 09:32:20,710 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:32:20,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2019-09-08 09:32:20,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 735. [2019-09-08 09:32:20,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2019-09-08 09:32:20,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 1185 transitions. [2019-09-08 09:32:20,752 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 1185 transitions. Word has length 65 [2019-09-08 09:32:20,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:20,753 INFO L475 AbstractCegarLoop]: Abstraction has 735 states and 1185 transitions. [2019-09-08 09:32:20,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:32:20,753 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 1185 transitions. [2019-09-08 09:32:20,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-09-08 09:32:20,756 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:20,757 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] [2019-09-08 09:32:20,757 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:20,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:20,757 INFO L82 PathProgramCache]: Analyzing trace with hash 1895724377, now seen corresponding path program 1 times [2019-09-08 09:32:20,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:20,758 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:20,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:20,759 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:20,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:20,923 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 09:32:20,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:20,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:32:20,924 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:32:20,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:32:20,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:32:20,925 INFO L87 Difference]: Start difference. First operand 735 states and 1185 transitions. Second operand 5 states. [2019-09-08 09:32:21,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:21,133 INFO L93 Difference]: Finished difference Result 2812 states and 4606 transitions. [2019-09-08 09:32:21,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:32:21,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 67 [2019-09-08 09:32:21,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:21,149 INFO L225 Difference]: With dead ends: 2812 [2019-09-08 09:32:21,149 INFO L226 Difference]: Without dead ends: 2158 [2019-09-08 09:32:21,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:32:21,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2019-09-08 09:32:21,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 1724. [2019-09-08 09:32:21,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1724 states. [2019-09-08 09:32:21,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1724 states to 1724 states and 2804 transitions. [2019-09-08 09:32:21,256 INFO L78 Accepts]: Start accepts. Automaton has 1724 states and 2804 transitions. Word has length 67 [2019-09-08 09:32:21,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:21,257 INFO L475 AbstractCegarLoop]: Abstraction has 1724 states and 2804 transitions. [2019-09-08 09:32:21,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:32:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand 1724 states and 2804 transitions. [2019-09-08 09:32:21,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 09:32:21,260 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:21,260 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:32:21,260 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:21,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:21,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1423696929, now seen corresponding path program 1 times [2019-09-08 09:32:21,261 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:21,261 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:21,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:21,263 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:21,263 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:21,385 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 09:32:21,386 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:21,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 09:32:21,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 09:32:21,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 09:32:21,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:32:21,387 INFO L87 Difference]: Start difference. First operand 1724 states and 2804 transitions. Second operand 6 states. [2019-09-08 09:32:21,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:21,954 INFO L93 Difference]: Finished difference Result 7785 states and 12674 transitions. [2019-09-08 09:32:21,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 09:32:21,955 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-09-08 09:32:21,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:21,991 INFO L225 Difference]: With dead ends: 7785 [2019-09-08 09:32:21,992 INFO L226 Difference]: Without dead ends: 6144 [2019-09-08 09:32:21,998 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2019-09-08 09:32:22,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6144 states. [2019-09-08 09:32:22,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6144 to 6075. [2019-09-08 09:32:22,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6075 states. [2019-09-08 09:32:22,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6075 states to 6075 states and 9815 transitions. [2019-09-08 09:32:22,486 INFO L78 Accepts]: Start accepts. Automaton has 6075 states and 9815 transitions. Word has length 68 [2019-09-08 09:32:22,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:22,487 INFO L475 AbstractCegarLoop]: Abstraction has 6075 states and 9815 transitions. [2019-09-08 09:32:22,487 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 09:32:22,487 INFO L276 IsEmpty]: Start isEmpty. Operand 6075 states and 9815 transitions. [2019-09-08 09:32:22,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 09:32:22,489 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:22,489 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:32:22,490 INFO L418 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:22,490 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:22,490 INFO L82 PathProgramCache]: Analyzing trace with hash 1771341997, now seen corresponding path program 1 times [2019-09-08 09:32:22,490 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:22,491 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:22,496 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:22,497 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:22,497 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:22,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:22,578 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 09:32:22,579 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:22,580 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:32:22,580 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:32:22,581 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:32:22,581 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:32:22,582 INFO L87 Difference]: Start difference. First operand 6075 states and 9815 transitions. Second operand 3 states. [2019-09-08 09:32:23,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:23,097 INFO L93 Difference]: Finished difference Result 12073 states and 19605 transitions. [2019-09-08 09:32:23,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:32:23,098 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 09:32:23,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:23,150 INFO L225 Difference]: With dead ends: 12073 [2019-09-08 09:32:23,150 INFO L226 Difference]: Without dead ends: 8429 [2019-09-08 09:32:23,162 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:32:23,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8429 states. [2019-09-08 09:32:23,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8429 to 8427. [2019-09-08 09:32:23,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8427 states. [2019-09-08 09:32:23,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8427 states to 8427 states and 13545 transitions. [2019-09-08 09:32:23,709 INFO L78 Accepts]: Start accepts. Automaton has 8427 states and 13545 transitions. Word has length 68 [2019-09-08 09:32:23,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:23,710 INFO L475 AbstractCegarLoop]: Abstraction has 8427 states and 13545 transitions. [2019-09-08 09:32:23,710 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:32:23,710 INFO L276 IsEmpty]: Start isEmpty. Operand 8427 states and 13545 transitions. [2019-09-08 09:32:23,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-09-08 09:32:23,711 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:23,711 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:32:23,712 INFO L418 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:23,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:23,712 INFO L82 PathProgramCache]: Analyzing trace with hash 334558445, now seen corresponding path program 1 times [2019-09-08 09:32:23,712 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:23,712 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:23,713 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:23,714 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:23,714 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:23,760 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 09:32:23,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:23,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:32:23,761 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:32:23,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:32:23,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:32:23,762 INFO L87 Difference]: Start difference. First operand 8427 states and 13545 transitions. Second operand 3 states. [2019-09-08 09:32:24,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:24,490 INFO L93 Difference]: Finished difference Result 19984 states and 32270 transitions. [2019-09-08 09:32:24,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:32:24,491 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 68 [2019-09-08 09:32:24,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:24,555 INFO L225 Difference]: With dead ends: 19984 [2019-09-08 09:32:24,555 INFO L226 Difference]: Without dead ends: 11643 [2019-09-08 09:32:24,585 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:32:24,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11643 states. [2019-09-08 09:32:25,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11643 to 11641. [2019-09-08 09:32:25,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11641 states. [2019-09-08 09:32:25,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11641 states to 11641 states and 18747 transitions. [2019-09-08 09:32:25,398 INFO L78 Accepts]: Start accepts. Automaton has 11641 states and 18747 transitions. Word has length 68 [2019-09-08 09:32:25,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:25,399 INFO L475 AbstractCegarLoop]: Abstraction has 11641 states and 18747 transitions. [2019-09-08 09:32:25,399 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:32:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 11641 states and 18747 transitions. [2019-09-08 09:32:25,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2019-09-08 09:32:25,400 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:25,400 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:32:25,400 INFO L418 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:25,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:25,401 INFO L82 PathProgramCache]: Analyzing trace with hash -1241984288, now seen corresponding path program 1 times [2019-09-08 09:32:25,401 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:25,401 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:25,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:25,402 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:25,402 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:25,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:25,488 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 09:32:25,489 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:25,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:32:25,489 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:32:25,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:32:25,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:32:25,490 INFO L87 Difference]: Start difference. First operand 11641 states and 18747 transitions. Second operand 4 states. [2019-09-08 09:32:26,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:26,651 INFO L93 Difference]: Finished difference Result 29799 states and 48089 transitions. [2019-09-08 09:32:26,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:32:26,652 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 69 [2019-09-08 09:32:26,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:26,701 INFO L225 Difference]: With dead ends: 29799 [2019-09-08 09:32:26,701 INFO L226 Difference]: Without dead ends: 18244 [2019-09-08 09:32:26,727 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:32:26,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18244 states. [2019-09-08 09:32:27,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18244 to 18159. [2019-09-08 09:32:27,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18159 states. [2019-09-08 09:32:27,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18159 states to 18159 states and 29150 transitions. [2019-09-08 09:32:27,624 INFO L78 Accepts]: Start accepts. Automaton has 18159 states and 29150 transitions. Word has length 69 [2019-09-08 09:32:27,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:27,625 INFO L475 AbstractCegarLoop]: Abstraction has 18159 states and 29150 transitions. [2019-09-08 09:32:27,625 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:32:27,625 INFO L276 IsEmpty]: Start isEmpty. Operand 18159 states and 29150 transitions. [2019-09-08 09:32:27,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2019-09-08 09:32:27,626 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:27,626 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:32:27,626 INFO L418 AbstractCegarLoop]: === Iteration 10 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:27,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:27,627 INFO L82 PathProgramCache]: Analyzing trace with hash 100698310, now seen corresponding path program 1 times [2019-09-08 09:32:27,627 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:27,627 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:27,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:27,629 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:27,629 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:27,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:27,691 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 09:32:27,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:27,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:32:27,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:32:27,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:32:27,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:32:27,692 INFO L87 Difference]: Start difference. First operand 18159 states and 29150 transitions. Second operand 4 states. [2019-09-08 09:32:29,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:29,242 INFO L93 Difference]: Finished difference Result 55078 states and 88556 transitions. [2019-09-08 09:32:29,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 09:32:29,244 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 70 [2019-09-08 09:32:29,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:29,348 INFO L225 Difference]: With dead ends: 55078 [2019-09-08 09:32:29,349 INFO L226 Difference]: Without dead ends: 37005 [2019-09-08 09:32:29,403 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:32:29,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37005 states. [2019-09-08 09:32:31,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37005 to 27463. [2019-09-08 09:32:31,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27463 states. [2019-09-08 09:32:31,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27463 states to 27463 states and 43903 transitions. [2019-09-08 09:32:31,391 INFO L78 Accepts]: Start accepts. Automaton has 27463 states and 43903 transitions. Word has length 70 [2019-09-08 09:32:31,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:31,392 INFO L475 AbstractCegarLoop]: Abstraction has 27463 states and 43903 transitions. [2019-09-08 09:32:31,392 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:32:31,392 INFO L276 IsEmpty]: Start isEmpty. Operand 27463 states and 43903 transitions. [2019-09-08 09:32:31,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2019-09-08 09:32:31,393 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:31,393 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:32:31,393 INFO L418 AbstractCegarLoop]: === Iteration 11 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:31,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:31,394 INFO L82 PathProgramCache]: Analyzing trace with hash 792159510, now seen corresponding path program 1 times [2019-09-08 09:32:31,394 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:31,394 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:31,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:31,395 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:31,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:31,545 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 09:32:31,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:31,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:32:31,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:32:31,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:32:31,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:32:31,546 INFO L87 Difference]: Start difference. First operand 27463 states and 43903 transitions. Second operand 5 states. [2019-09-08 09:32:32,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:32,523 INFO L93 Difference]: Finished difference Result 57234 states and 91571 transitions. [2019-09-08 09:32:32,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:32:32,523 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 72 [2019-09-08 09:32:32,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:32,611 INFO L225 Difference]: With dead ends: 57234 [2019-09-08 09:32:32,611 INFO L226 Difference]: Without dead ends: 29857 [2019-09-08 09:32:32,685 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:32:32,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29857 states. [2019-09-08 09:32:33,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29857 to 27463. [2019-09-08 09:32:33,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27463 states. [2019-09-08 09:32:33,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27463 states to 27463 states and 43753 transitions. [2019-09-08 09:32:33,961 INFO L78 Accepts]: Start accepts. Automaton has 27463 states and 43753 transitions. Word has length 72 [2019-09-08 09:32:33,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:33,962 INFO L475 AbstractCegarLoop]: Abstraction has 27463 states and 43753 transitions. [2019-09-08 09:32:33,962 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:32:33,962 INFO L276 IsEmpty]: Start isEmpty. Operand 27463 states and 43753 transitions. [2019-09-08 09:32:33,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-09-08 09:32:33,963 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:33,963 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:32:33,963 INFO L418 AbstractCegarLoop]: === Iteration 12 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:33,964 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:33,964 INFO L82 PathProgramCache]: Analyzing trace with hash 624122737, now seen corresponding path program 1 times [2019-09-08 09:32:33,964 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:33,964 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:33,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:33,965 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:33,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:33,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:34,108 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 09:32:34,108 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:34,108 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:32:34,109 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:32:34,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:32:34,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:32:34,110 INFO L87 Difference]: Start difference. First operand 27463 states and 43753 transitions. Second operand 5 states. [2019-09-08 09:32:36,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:36,781 INFO L93 Difference]: Finished difference Result 77198 states and 123205 transitions. [2019-09-08 09:32:36,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:32:36,781 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 75 [2019-09-08 09:32:36,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:36,872 INFO L225 Difference]: With dead ends: 77198 [2019-09-08 09:32:36,872 INFO L226 Difference]: Without dead ends: 49821 [2019-09-08 09:32:36,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-09-08 09:32:36,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49821 states. [2019-09-08 09:32:38,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49821 to 49819. [2019-09-08 09:32:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49819 states. [2019-09-08 09:32:38,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49819 states to 49819 states and 78937 transitions. [2019-09-08 09:32:38,661 INFO L78 Accepts]: Start accepts. Automaton has 49819 states and 78937 transitions. Word has length 75 [2019-09-08 09:32:38,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:38,661 INFO L475 AbstractCegarLoop]: Abstraction has 49819 states and 78937 transitions. [2019-09-08 09:32:38,661 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:32:38,661 INFO L276 IsEmpty]: Start isEmpty. Operand 49819 states and 78937 transitions. [2019-09-08 09:32:38,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-09-08 09:32:38,662 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:38,662 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 09:32:38,662 INFO L418 AbstractCegarLoop]: === Iteration 13 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:38,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:38,662 INFO L82 PathProgramCache]: Analyzing trace with hash -2128940941, now seen corresponding path program 1 times [2019-09-08 09:32:38,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:38,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:38,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:38,664 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:38,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:38,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:32:38,762 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:38,762 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 09:32:38,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 09:32:38,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 09:32:38,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:32:38,763 INFO L87 Difference]: Start difference. First operand 49819 states and 78937 transitions. Second operand 5 states. [2019-09-08 09:32:42,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:42,397 INFO L93 Difference]: Finished difference Result 87946 states and 138501 transitions. [2019-09-08 09:32:42,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 09:32:42,397 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 76 [2019-09-08 09:32:42,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:42,555 INFO L225 Difference]: With dead ends: 87946 [2019-09-08 09:32:42,555 INFO L226 Difference]: Without dead ends: 87944 [2019-09-08 09:32:42,579 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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 09:32:42,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87944 states. [2019-09-08 09:32:44,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87944 to 51007. [2019-09-08 09:32:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51007 states. [2019-09-08 09:32:44,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51007 states to 51007 states and 80107 transitions. [2019-09-08 09:32:44,939 INFO L78 Accepts]: Start accepts. Automaton has 51007 states and 80107 transitions. Word has length 76 [2019-09-08 09:32:44,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:44,940 INFO L475 AbstractCegarLoop]: Abstraction has 51007 states and 80107 transitions. [2019-09-08 09:32:44,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 09:32:44,940 INFO L276 IsEmpty]: Start isEmpty. Operand 51007 states and 80107 transitions. [2019-09-08 09:32:44,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:32:44,943 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:44,944 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:32:44,944 INFO L418 AbstractCegarLoop]: === Iteration 14 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:44,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:44,944 INFO L82 PathProgramCache]: Analyzing trace with hash -294350133, now seen corresponding path program 1 times [2019-09-08 09:32:44,944 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:44,945 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:44,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:44,947 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:44,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-09-08 09:32:45,140 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:45,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:32:45,141 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:32:45,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:32:45,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:32:45,142 INFO L87 Difference]: Start difference. First operand 51007 states and 80107 transitions. Second operand 4 states. [2019-09-08 09:32:48,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:32:48,189 INFO L93 Difference]: Finished difference Result 106417 states and 168361 transitions. [2019-09-08 09:32:48,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:32:48,190 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-08 09:32:48,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:32:48,324 INFO L225 Difference]: With dead ends: 106417 [2019-09-08 09:32:48,325 INFO L226 Difference]: Without dead ends: 82748 [2019-09-08 09:32:48,372 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:32:48,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82748 states. [2019-09-08 09:32:52,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82748 to 73048. [2019-09-08 09:32:52,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73048 states. [2019-09-08 09:32:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73048 states to 73048 states and 115051 transitions. [2019-09-08 09:32:52,880 INFO L78 Accepts]: Start accepts. Automaton has 73048 states and 115051 transitions. Word has length 97 [2019-09-08 09:32:52,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:32:52,880 INFO L475 AbstractCegarLoop]: Abstraction has 73048 states and 115051 transitions. [2019-09-08 09:32:52,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:32:52,880 INFO L276 IsEmpty]: Start isEmpty. Operand 73048 states and 115051 transitions. [2019-09-08 09:32:52,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:32:52,881 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:32:52,882 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:32:52,882 INFO L418 AbstractCegarLoop]: === Iteration 15 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:32:52,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:32:52,882 INFO L82 PathProgramCache]: Analyzing trace with hash -266072244, now seen corresponding path program 1 times [2019-09-08 09:32:52,883 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:32:52,883 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:32:52,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:52,884 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:32:52,884 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:32:52,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:32:53,103 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-09-08 09:32:53,103 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:32:53,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 09:32:53,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 09:32:53,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 09:32:53,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-08 09:32:53,105 INFO L87 Difference]: Start difference. First operand 73048 states and 115051 transitions. Second operand 4 states. [2019-09-08 09:33:00,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:33:00,108 INFO L93 Difference]: Finished difference Result 156999 states and 249135 transitions. [2019-09-08 09:33:00,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 09:33:00,108 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 97 [2019-09-08 09:33:00,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:33:00,290 INFO L225 Difference]: With dead ends: 156999 [2019-09-08 09:33:00,290 INFO L226 Difference]: Without dead ends: 122185 [2019-09-08 09:33:00,346 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 09:33:00,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122185 states. [2019-09-08 09:33:05,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122185 to 107790. [2019-09-08 09:33:05,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107790 states. [2019-09-08 09:33:05,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107790 states to 107790 states and 170277 transitions. [2019-09-08 09:33:05,461 INFO L78 Accepts]: Start accepts. Automaton has 107790 states and 170277 transitions. Word has length 97 [2019-09-08 09:33:05,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:33:05,462 INFO L475 AbstractCegarLoop]: Abstraction has 107790 states and 170277 transitions. [2019-09-08 09:33:05,462 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 09:33:05,462 INFO L276 IsEmpty]: Start isEmpty. Operand 107790 states and 170277 transitions. [2019-09-08 09:33:05,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:33:05,463 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:33:05,463 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:33:05,463 INFO L418 AbstractCegarLoop]: === Iteration 16 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:33:05,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:33:05,464 INFO L82 PathProgramCache]: Analyzing trace with hash 1991425558, now seen corresponding path program 1 times [2019-09-08 09:33:05,464 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:33:05,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:33:05,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:05,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:33:05,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:33:05,531 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:33:05,531 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:33:05,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:33:05,532 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:33:05,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:33:05,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:33:05,532 INFO L87 Difference]: Start difference. First operand 107790 states and 170277 transitions. Second operand 3 states. [2019-09-08 09:33:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:33:11,809 INFO L93 Difference]: Finished difference Result 200642 states and 317154 transitions. [2019-09-08 09:33:11,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:33:11,810 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-09-08 09:33:11,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:33:11,946 INFO L225 Difference]: With dead ends: 200642 [2019-09-08 09:33:11,946 INFO L226 Difference]: Without dead ends: 92938 [2019-09-08 09:33:12,027 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:33:12,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92938 states. [2019-09-08 09:33:16,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92938 to 92936. [2019-09-08 09:33:16,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92936 states. [2019-09-08 09:33:16,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92936 states to 92936 states and 145886 transitions. [2019-09-08 09:33:16,569 INFO L78 Accepts]: Start accepts. Automaton has 92936 states and 145886 transitions. Word has length 97 [2019-09-08 09:33:16,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:33:16,569 INFO L475 AbstractCegarLoop]: Abstraction has 92936 states and 145886 transitions. [2019-09-08 09:33:16,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:33:16,569 INFO L276 IsEmpty]: Start isEmpty. Operand 92936 states and 145886 transitions. [2019-09-08 09:33:16,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-09-08 09:33:16,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:33:16,571 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:33:16,571 INFO L418 AbstractCegarLoop]: === Iteration 17 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:33:16,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:33:16,571 INFO L82 PathProgramCache]: Analyzing trace with hash -25120715, now seen corresponding path program 1 times [2019-09-08 09:33:16,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:33:16,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:33:16,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:16,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:33:16,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:33:16,672 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:33:16,672 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:33:16,672 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:33:16,689 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:33:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:33:16,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 842 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 09:33:16,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:33:16,954 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 09:33:16,969 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:33:16,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2019-09-08 09:33:16,971 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-08 09:33:16,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-08 09:33:16,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-09-08 09:33:16,972 INFO L87 Difference]: Start difference. First operand 92936 states and 145886 transitions. Second operand 8 states. [2019-09-08 09:33:28,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:33:28,546 INFO L93 Difference]: Finished difference Result 235349 states and 370922 transitions. [2019-09-08 09:33:28,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-08 09:33:28,547 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2019-09-08 09:33:28,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:33:29,143 INFO L225 Difference]: With dead ends: 235349 [2019-09-08 09:33:29,143 INFO L226 Difference]: Without dead ends: 185689 [2019-09-08 09:33:29,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 95 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=131, Unknown=0, NotChecked=0, Total=210 [2019-09-08 09:33:29,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185689 states. [2019-09-08 09:33:40,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185689 to 145978. [2019-09-08 09:33:40,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145978 states. [2019-09-08 09:33:41,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145978 states to 145978 states and 229499 transitions. [2019-09-08 09:33:41,020 INFO L78 Accepts]: Start accepts. Automaton has 145978 states and 229499 transitions. Word has length 97 [2019-09-08 09:33:41,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:33:41,021 INFO L475 AbstractCegarLoop]: Abstraction has 145978 states and 229499 transitions. [2019-09-08 09:33:41,021 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-08 09:33:41,021 INFO L276 IsEmpty]: Start isEmpty. Operand 145978 states and 229499 transitions. [2019-09-08 09:33:41,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-09-08 09:33:41,022 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:33:41,022 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:33:41,023 INFO L418 AbstractCegarLoop]: === Iteration 18 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:33:41,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:33:41,023 INFO L82 PathProgramCache]: Analyzing trace with hash -3265366, now seen corresponding path program 1 times [2019-09-08 09:33:41,023 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:33:41,023 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:33:41,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:41,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:33:41,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:33:41,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:33:41,089 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-09-08 09:33:41,090 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:33:41,090 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:33:41,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:33:41,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:33:41,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:33:41,091 INFO L87 Difference]: Start difference. First operand 145978 states and 229499 transitions. Second operand 3 states. [2019-09-08 09:33:57,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:33:57,960 INFO L93 Difference]: Finished difference Result 415851 states and 654053 transitions. [2019-09-08 09:33:57,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:33:57,961 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 98 [2019-09-08 09:33:57,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:33:58,517 INFO L225 Difference]: With dead ends: 415851 [2019-09-08 09:33:58,517 INFO L226 Difference]: Without dead ends: 272981 [2019-09-08 09:33:58,671 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:33:58,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272981 states. [2019-09-08 09:34:17,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272981 to 272573. [2019-09-08 09:34:17,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272573 states. [2019-09-08 09:34:17,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272573 states to 272573 states and 428028 transitions. [2019-09-08 09:34:17,776 INFO L78 Accepts]: Start accepts. Automaton has 272573 states and 428028 transitions. Word has length 98 [2019-09-08 09:34:17,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:34:17,776 INFO L475 AbstractCegarLoop]: Abstraction has 272573 states and 428028 transitions. [2019-09-08 09:34:17,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:34:17,776 INFO L276 IsEmpty]: Start isEmpty. Operand 272573 states and 428028 transitions. [2019-09-08 09:34:17,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 09:34:17,778 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:34:17,778 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:34:17,778 INFO L418 AbstractCegarLoop]: === Iteration 19 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:34:17,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:34:17,778 INFO L82 PathProgramCache]: Analyzing trace with hash -1796285147, now seen corresponding path program 1 times [2019-09-08 09:34:17,779 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:34:17,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:34:17,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:34:17,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:34:17,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:34:17,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:34:17,850 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:34:17,850 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:34:17,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:34:17,851 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:34:17,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:34:17,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:34:17,852 INFO L87 Difference]: Start difference. First operand 272573 states and 428028 transitions. Second operand 3 states. [2019-09-08 09:34:51,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:34:51,336 INFO L93 Difference]: Finished difference Result 802870 states and 1260723 transitions. [2019-09-08 09:34:51,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:34:51,336 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 09:34:51,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:34:52,299 INFO L225 Difference]: With dead ends: 802870 [2019-09-08 09:34:52,299 INFO L226 Difference]: Without dead ends: 530385 [2019-09-08 09:34:52,547 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:34:52,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530385 states. [2019-09-08 09:35:34,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530385 to 530383. [2019-09-08 09:35:34,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530383 states. [2019-09-08 09:35:35,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530383 states to 530383 states and 827477 transitions. [2019-09-08 09:35:35,554 INFO L78 Accepts]: Start accepts. Automaton has 530383 states and 827477 transitions. Word has length 99 [2019-09-08 09:35:35,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:35:35,555 INFO L475 AbstractCegarLoop]: Abstraction has 530383 states and 827477 transitions. [2019-09-08 09:35:35,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:35:35,555 INFO L276 IsEmpty]: Start isEmpty. Operand 530383 states and 827477 transitions. [2019-09-08 09:35:35,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-09-08 09:35:35,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:35:35,558 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:35:35,558 INFO L418 AbstractCegarLoop]: === Iteration 20 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:35:35,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:35:35,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1778333935, now seen corresponding path program 1 times [2019-09-08 09:35:35,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:35:35,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:35:35,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:35,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:35:35,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:35:35,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:35:35,619 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:35:35,620 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 09:35:35,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 09:35:35,620 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 09:35:35,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 09:35:35,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:35:35,621 INFO L87 Difference]: Start difference. First operand 530383 states and 827477 transitions. Second operand 3 states. [2019-09-08 09:36:50,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:36:50,273 INFO L93 Difference]: Finished difference Result 1556388 states and 2428106 transitions. [2019-09-08 09:36:50,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 09:36:50,273 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-09-08 09:36:50,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:36:52,489 INFO L225 Difference]: With dead ends: 1556388 [2019-09-08 09:36:52,490 INFO L226 Difference]: Without dead ends: 1026138 [2019-09-08 09:36:53,820 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 09:36:54,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1026138 states. [2019-09-08 09:38:35,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1026138 to 1026136. [2019-09-08 09:38:35,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1026136 states. [2019-09-08 09:38:37,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026136 states to 1026136 states and 1588866 transitions. [2019-09-08 09:38:37,188 INFO L78 Accepts]: Start accepts. Automaton has 1026136 states and 1588866 transitions. Word has length 99 [2019-09-08 09:38:37,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 09:38:37,188 INFO L475 AbstractCegarLoop]: Abstraction has 1026136 states and 1588866 transitions. [2019-09-08 09:38:37,188 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 09:38:37,188 INFO L276 IsEmpty]: Start isEmpty. Operand 1026136 states and 1588866 transitions. [2019-09-08 09:38:37,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2019-09-08 09:38:37,192 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 09:38:37,192 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:38:37,192 INFO L418 AbstractCegarLoop]: === Iteration 21 === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 09:38:37,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 09:38:37,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1384335120, now seen corresponding path program 1 times [2019-09-08 09:38:37,193 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 09:38:37,193 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 09:38:37,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:37,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:37,194 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 09:38:37,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:37,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 09:38:37,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 09:38:37,304 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 09:38:37,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 09:38:37,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 09:38:37,444 INFO L256 TraceCheckSpWp]: Trace formula consists of 854 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 09:38:37,450 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 09:38:37,489 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Broken pipe [2019-09-08 09:38:37,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 09:38:37,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 7 [2019-09-08 09:38:37,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 09:38:37,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 09:38:37,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-08 09:38:37,505 INFO L87 Difference]: Start difference. First operand 1026136 states and 1588866 transitions. Second operand 7 states. [2019-09-08 09:41:17,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 09:41:17,991 INFO L93 Difference]: Finished difference Result 2749480 states and 4267008 transitions. [2019-09-08 09:41:17,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 09:41:17,991 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 102 [2019-09-08 09:41:17,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 09:41:22,000 INFO L225 Difference]: With dead ends: 2749480 [2019-09-08 09:41:22,000 INFO L226 Difference]: Without dead ends: 1854834 [2019-09-08 09:41:22,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2019-09-08 09:41:24,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1854834 states.