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/loops/linear_search.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-0883e75 [2019-09-05 11:29:13,539 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-05 11:29:13,542 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-05 11:29:13,554 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-05 11:29:13,554 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-05 11:29:13,555 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-05 11:29:13,557 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-05 11:29:13,559 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-05 11:29:13,560 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-05 11:29:13,561 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-05 11:29:13,562 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-05 11:29:13,563 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-05 11:29:13,564 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-05 11:29:13,565 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-05 11:29:13,566 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-05 11:29:13,567 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-05 11:29:13,568 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-05 11:29:13,569 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-05 11:29:13,570 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-05 11:29:13,572 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-05 11:29:13,573 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-05 11:29:13,575 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-05 11:29:13,576 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-05 11:29:13,576 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-05 11:29:13,578 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-05 11:29:13,579 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-05 11:29:13,579 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-05 11:29:13,580 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-05 11:29:13,580 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-05 11:29:13,581 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-05 11:29:13,581 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-05 11:29:13,582 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-05 11:29:13,583 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-05 11:29:13,583 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-05 11:29:13,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-05 11:29:13,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-05 11:29:13,585 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-05 11:29:13,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-05 11:29:13,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-05 11:29:13,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-05 11:29:13,587 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-05 11:29:13,588 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-05 11:29:13,619 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-05 11:29:13,620 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-05 11:29:13,622 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-05 11:29:13,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-05 11:29:13,623 INFO L138 SettingsManager]: * Use SBE=true [2019-09-05 11:29:13,623 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-05 11:29:13,623 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-05 11:29:13,624 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-05 11:29:13,624 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-05 11:29:13,624 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-05 11:29:13,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-05 11:29:13,626 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-05 11:29:13,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-05 11:29:13,626 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-05 11:29:13,627 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-05 11:29:13,627 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-05 11:29:13,627 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-05 11:29:13,627 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-05 11:29:13,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-05 11:29:13,627 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-05 11:29:13,628 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-05 11:29:13,628 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-05 11:29:13,628 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-05 11:29:13,629 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-05 11:29:13,629 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-05 11:29:13,629 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-05 11:29:13,629 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-05 11:29:13,629 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-05 11:29:13,630 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-05 11:29:13,681 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-05 11:29:13,698 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-05 11:29:13,704 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-05 11:29:13,705 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-05 11:29:13,706 INFO L275 PluginConnector]: CDTParser initialized [2019-09-05 11:29:13,706 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_search.c [2019-09-05 11:29:13,788 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5538c32b/f58a5cf0e0524e1c8164c6d3bb9b1dac/FLAG6bdd877c8 [2019-09-05 11:29:14,291 INFO L306 CDTParser]: Found 1 translation units. [2019-09-05 11:29:14,292 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c [2019-09-05 11:29:14,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5538c32b/f58a5cf0e0524e1c8164c6d3bb9b1dac/FLAG6bdd877c8 [2019-09-05 11:29:14,659 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b5538c32b/f58a5cf0e0524e1c8164c6d3bb9b1dac [2019-09-05 11:29:14,669 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-05 11:29:14,671 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-05 11:29:14,672 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-05 11:29:14,672 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-05 11:29:14,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-05 11:29:14,677 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:29:14" (1/1) ... [2019-09-05 11:29:14,680 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79c6fc99 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:14, skipping insertion in model container [2019-09-05 11:29:14,681 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.09 11:29:14" (1/1) ... [2019-09-05 11:29:14,688 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-05 11:29:14,707 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-05 11:29:14,904 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:29:14,915 INFO L188 MainTranslator]: Completed pre-run [2019-09-05 11:29:14,931 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-05 11:29:15,036 INFO L192 MainTranslator]: Completed translation [2019-09-05 11:29:15,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:15 WrapperNode [2019-09-05 11:29:15,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-05 11:29:15,037 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-05 11:29:15,037 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-05 11:29:15,037 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-05 11:29:15,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:15" (1/1) ... [2019-09-05 11:29:15,048 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:15" (1/1) ... [2019-09-05 11:29:15,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:15" (1/1) ... [2019-09-05 11:29:15,054 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:15" (1/1) ... [2019-09-05 11:29:15,061 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:15" (1/1) ... [2019-09-05 11:29:15,066 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:15" (1/1) ... [2019-09-05 11:29:15,067 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:15" (1/1) ... [2019-09-05 11:29:15,069 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-05 11:29:15,070 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-05 11:29:15,070 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-05 11:29:15,070 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-05 11:29:15,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:15" (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-05 11:29:15,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-05 11:29:15,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-05 11:29:15,128 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-09-05 11:29:15,128 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2019-09-05 11:29:15,128 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-05 11:29:15,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-05 11:29:15,128 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-05 11:29:15,128 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-09-05 11:29:15,129 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2019-09-05 11:29:15,129 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2019-09-05 11:29:15,129 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-05 11:29:15,129 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-05 11:29:15,129 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-05 11:29:15,129 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-05 11:29:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-05 11:29:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-05 11:29:15,130 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-05 11:29:15,387 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-05 11:29:15,388 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-09-05 11:29:15,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:29:15 BoogieIcfgContainer [2019-09-05 11:29:15,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-05 11:29:15,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-05 11:29:15,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-05 11:29:15,401 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-05 11:29:15,401 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.09 11:29:14" (1/3) ... [2019-09-05 11:29:15,402 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a17e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:29:15, skipping insertion in model container [2019-09-05 11:29:15,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.09 11:29:15" (2/3) ... [2019-09-05 11:29:15,403 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@65a17e0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.09 11:29:15, skipping insertion in model container [2019-09-05 11:29:15,403 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.09 11:29:15" (3/3) ... [2019-09-05 11:29:15,405 INFO L109 eAbstractionObserver]: Analyzing ICFG linear_search.c [2019-09-05 11:29:15,429 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-05 11:29:15,437 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-05 11:29:15,469 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-05 11:29:15,497 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-05 11:29:15,497 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-05 11:29:15,497 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-05 11:29:15,497 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-05 11:29:15,497 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-05 11:29:15,498 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-05 11:29:15,498 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-05 11:29:15,498 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-05 11:29:15,498 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-05 11:29:15,512 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2019-09-05 11:29:15,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-09-05 11:29:15,518 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:15,519 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:15,520 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:15,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:15,525 INFO L82 PathProgramCache]: Analyzing trace with hash 868129876, now seen corresponding path program 1 times [2019-09-05 11:29:15,527 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:15,527 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:15,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:15,567 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:15,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:15,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:15,699 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-05 11:29:15,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:15,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-09-05 11:29:15,705 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-05 11:29:15,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-05 11:29:15,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 11:29:15,720 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 2 states. [2019-09-05 11:29:15,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:15,744 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-09-05 11:29:15,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-05 11:29:15,746 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 18 [2019-09-05 11:29:15,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:15,755 INFO L225 Difference]: With dead ends: 45 [2019-09-05 11:29:15,755 INFO L226 Difference]: Without dead ends: 22 [2019-09-05 11:29:15,759 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-05 11:29:15,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-05 11:29:15,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-05 11:29:15,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-05 11:29:15,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2019-09-05 11:29:15,798 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2019-09-05 11:29:15,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:15,798 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2019-09-05 11:29:15,798 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-05 11:29:15,799 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2019-09-05 11:29:15,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:29:15,800 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:15,800 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] [2019-09-05 11:29:15,800 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:15,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:15,801 INFO L82 PathProgramCache]: Analyzing trace with hash -202652409, now seen corresponding path program 1 times [2019-09-05 11:29:15,801 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:15,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:15,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:15,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:15,803 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:15,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:15,987 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-05 11:29:15,988 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:15,988 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-05 11:29:15,990 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:29:15,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:29:15,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:29:15,992 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand 6 states. [2019-09-05 11:29:16,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:16,044 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2019-09-05 11:29:16,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:29:16,045 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2019-09-05 11:29:16,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:16,046 INFO L225 Difference]: With dead ends: 30 [2019-09-05 11:29:16,046 INFO L226 Difference]: Without dead ends: 22 [2019-09-05 11:29:16,047 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:29:16,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-09-05 11:29:16,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-09-05 11:29:16,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-09-05 11:29:16,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-09-05 11:29:16,053 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2019-09-05 11:29:16,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:16,053 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-09-05 11:29:16,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:29:16,054 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-09-05 11:29:16,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-09-05 11:29:16,055 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:16,055 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] [2019-09-05 11:29:16,055 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:16,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:16,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1540157926, now seen corresponding path program 1 times [2019-09-05 11:29:16,056 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:16,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:16,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:16,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:16,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:16,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:16,216 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-05 11:29:16,217 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:16,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-05 11:29:16,217 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-05 11:29:16,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-05 11:29:16,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-05 11:29:16,219 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 5 states. [2019-09-05 11:29:16,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:16,297 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-09-05 11:29:16,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:29:16,298 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2019-09-05 11:29:16,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:16,300 INFO L225 Difference]: With dead ends: 34 [2019-09-05 11:29:16,301 INFO L226 Difference]: Without dead ends: 25 [2019-09-05 11:29:16,302 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:29:16,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-09-05 11:29:16,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-09-05 11:29:16,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-09-05 11:29:16,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2019-09-05 11:29:16,312 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2019-09-05 11:29:16,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:16,313 INFO L475 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2019-09-05 11:29:16,313 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-05 11:29:16,313 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2019-09-05 11:29:16,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 11:29:16,315 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:16,315 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:16,316 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:16,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:16,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1697189824, now seen corresponding path program 1 times [2019-09-05 11:29:16,317 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:16,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:16,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:16,319 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:16,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:16,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:16,476 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:16,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-05 11:29:16,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-05 11:29:16,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-05 11:29:16,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-05 11:29:16,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-05 11:29:16,479 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 4 states. [2019-09-05 11:29:16,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:16,521 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2019-09-05 11:29:16,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-05 11:29:16,522 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-09-05 11:29:16,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:16,526 INFO L225 Difference]: With dead ends: 45 [2019-09-05 11:29:16,526 INFO L226 Difference]: Without dead ends: 32 [2019-09-05 11:29:16,527 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-05 11:29:16,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-09-05 11:29:16,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2019-09-05 11:29:16,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-09-05 11:29:16,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2019-09-05 11:29:16,534 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 24 [2019-09-05 11:29:16,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:16,535 INFO L475 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2019-09-05 11:29:16,535 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-05 11:29:16,535 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2019-09-05 11:29:16,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 11:29:16,536 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:16,536 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:16,537 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:16,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:16,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1439024386, now seen corresponding path program 1 times [2019-09-05 11:29:16,537 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:16,537 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:16,538 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:16,539 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:16,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:16,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:16,789 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:16,790 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:16,790 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) [2019-09-05 11:29:16,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:16,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:16,868 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 11:29:16,876 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-05 11:29:17,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:17,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 13 [2019-09-05 11:29:17,113 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-09-05 11:29:17,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-09-05 11:29:17,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2019-09-05 11:29:17,114 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand 13 states. [2019-09-05 11:29:17,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:17,497 INFO L93 Difference]: Finished difference Result 37 states and 40 transitions. [2019-09-05 11:29:17,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:29:17,498 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2019-09-05 11:29:17,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:17,499 INFO L225 Difference]: With dead ends: 37 [2019-09-05 11:29:17,499 INFO L226 Difference]: Without dead ends: 28 [2019-09-05 11:29:17,500 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=85, Invalid=221, Unknown=0, NotChecked=0, Total=306 [2019-09-05 11:29:17,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-09-05 11:29:17,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2019-09-05 11:29:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-09-05 11:29:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2019-09-05 11:29:17,507 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 24 [2019-09-05 11:29:17,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:17,508 INFO L475 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2019-09-05 11:29:17,510 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-09-05 11:29:17,510 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2019-09-05 11:29:17,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-09-05 11:29:17,512 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:17,512 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:17,512 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:17,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:17,513 INFO L82 PathProgramCache]: Analyzing trace with hash -1832051396, now seen corresponding path program 1 times [2019-09-05 11:29:17,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:17,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:17,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:17,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:17,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:17,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:17,680 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:17,681 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:17,681 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) [2019-09-05 11:29:17,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:17,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 6 conjunts are in the unsatisfiable core [2019-09-05 11:29:17,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:17,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:17,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:17,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 8 [2019-09-05 11:29:17,777 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:29:17,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:29:17,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:29:17,778 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand 8 states. [2019-09-05 11:29:17,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:17,871 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2019-09-05 11:29:17,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:29:17,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 24 [2019-09-05 11:29:17,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:17,874 INFO L225 Difference]: With dead ends: 40 [2019-09-05 11:29:17,874 INFO L226 Difference]: Without dead ends: 31 [2019-09-05 11:29:17,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 3 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:29:17,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-09-05 11:29:17,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 29. [2019-09-05 11:29:17,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-09-05 11:29:17,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2019-09-05 11:29:17,882 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 24 [2019-09-05 11:29:17,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:17,882 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2019-09-05 11:29:17,882 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:29:17,883 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2019-09-05 11:29:17,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 11:29:17,884 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:17,884 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:17,884 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:17,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:17,884 INFO L82 PathProgramCache]: Analyzing trace with hash -648228970, now seen corresponding path program 1 times [2019-09-05 11:29:17,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:17,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:17,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:17,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:17,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:17,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:17,969 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:17,969 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:17,970 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:17,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:18,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:18,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 8 conjunts are in the unsatisfiable core [2019-09-05 11:29:18,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:18,051 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:18,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:18,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-09-05 11:29:18,057 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-05 11:29:18,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-05 11:29:18,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:29:18,058 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand 6 states. [2019-09-05 11:29:18,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:18,124 INFO L93 Difference]: Finished difference Result 52 states and 61 transitions. [2019-09-05 11:29:18,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-05 11:29:18,125 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-09-05 11:29:18,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:18,126 INFO L225 Difference]: With dead ends: 52 [2019-09-05 11:29:18,126 INFO L226 Difference]: Without dead ends: 38 [2019-09-05 11:29:18,127 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-09-05 11:29:18,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-09-05 11:29:18,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2019-09-05 11:29:18,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-09-05 11:29:18,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2019-09-05 11:29:18,134 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 28 [2019-09-05 11:29:18,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:18,147 INFO L475 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2019-09-05 11:29:18,148 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-05 11:29:18,148 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2019-09-05 11:29:18,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-09-05 11:29:18,150 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:18,150 INFO L399 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:18,150 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:18,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:18,151 INFO L82 PathProgramCache]: Analyzing trace with hash -390063532, now seen corresponding path program 2 times [2019-09-05 11:29:18,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:18,152 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:18,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:18,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-05 11:29:18,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:18,678 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 162 DAG size of output: 39 [2019-09-05 11:29:19,440 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 44 [2019-09-05 11:29:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:19,452 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:19,453 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:19,479 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:29:19,562 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:19,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:19,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 41 conjunts are in the unsatisfiable core [2019-09-05 11:29:19,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:19,570 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:23,740 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 49 [2019-09-05 11:29:23,741 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:23,758 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 50 [2019-09-05 11:29:23,759 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:23,815 INFO L567 ElimStorePlain]: treesize reduction 309, result has 8.8 percent of original size [2019-09-05 11:29:23,816 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_6| vanished before elimination [2019-09-05 11:29:23,816 INFO L464 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2019-09-05 11:29:23,816 INFO L464 ElimStorePlain]: Eliminatee v_prenex_4 vanished before elimination [2019-09-05 11:29:23,817 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 4 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-09-05 11:29:23,817 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:347, output treesize:30 [2019-09-05 11:29:25,394 WARN L188 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 57 DAG size of output: 46 [2019-09-05 11:29:27,058 WARN L188 SmtUtils]: Spent 1.26 s on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-05 11:29:27,321 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:27,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:27,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11] total 21 [2019-09-05 11:29:27,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-09-05 11:29:27,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-09-05 11:29:27,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=360, Unknown=1, NotChecked=0, Total=420 [2019-09-05 11:29:27,334 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 21 states. [2019-09-05 11:29:29,330 WARN L188 SmtUtils]: Spent 1.09 s on a formula simplification. DAG size of input: 57 DAG size of output: 39 [2019-09-05 11:29:29,864 WARN L188 SmtUtils]: Spent 480.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2019-09-05 11:29:30,427 WARN L188 SmtUtils]: Spent 519.00 ms on a formula simplification. DAG size of input: 46 DAG size of output: 44 [2019-09-05 11:29:31,144 WARN L188 SmtUtils]: Spent 622.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2019-09-05 11:29:32,007 WARN L188 SmtUtils]: Spent 524.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 65 [2019-09-05 11:29:32,878 WARN L188 SmtUtils]: Spent 827.00 ms on a formula simplification that was a NOOP. DAG size: 63 [2019-09-05 11:29:34,408 WARN L188 SmtUtils]: Spent 1.47 s on a formula simplification. DAG size of input: 107 DAG size of output: 74 [2019-09-05 11:29:35,702 WARN L188 SmtUtils]: Spent 1.24 s on a formula simplification. DAG size of input: 94 DAG size of output: 80 [2019-09-05 11:29:36,697 WARN L188 SmtUtils]: Spent 941.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 78 [2019-09-05 11:29:37,117 WARN L188 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 55 [2019-09-05 11:29:39,061 WARN L188 SmtUtils]: Spent 1.62 s on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2019-09-05 11:29:40,468 WARN L188 SmtUtils]: Spent 1.33 s on a formula simplification. DAG size of input: 85 DAG size of output: 61 [2019-09-05 11:29:41,290 WARN L188 SmtUtils]: Spent 762.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2019-09-05 11:29:41,830 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 53 [2019-09-05 11:29:42,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:42,047 INFO L93 Difference]: Finished difference Result 74 states and 88 transitions. [2019-09-05 11:29:42,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-09-05 11:29:42,052 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 28 [2019-09-05 11:29:42,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:42,054 INFO L225 Difference]: With dead ends: 74 [2019-09-05 11:29:42,054 INFO L226 Difference]: Without dead ends: 44 [2019-09-05 11:29:42,055 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=309, Invalid=1496, Unknown=1, NotChecked=0, Total=1806 [2019-09-05 11:29:42,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-09-05 11:29:42,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 33. [2019-09-05 11:29:42,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-09-05 11:29:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2019-09-05 11:29:42,068 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 28 [2019-09-05 11:29:42,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:42,068 INFO L475 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2019-09-05 11:29:42,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-09-05 11:29:42,069 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2019-09-05 11:29:42,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 11:29:42,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:42,071 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:42,072 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:42,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:42,073 INFO L82 PathProgramCache]: Analyzing trace with hash -723812178, now seen corresponding path program 2 times [2019-09-05 11:29:42,073 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:42,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:42,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:42,075 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:42,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:42,148 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:42,148 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:42,164 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-05 11:29:42,200 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-05 11:29:42,200 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:42,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 10 conjunts are in the unsatisfiable core [2019-09-05 11:29:42,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:42,227 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:42,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:42,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-09-05 11:29:42,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-05 11:29:42,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-05 11:29:42,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:29:42,235 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 7 states. [2019-09-05 11:29:42,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:42,325 INFO L93 Difference]: Finished difference Result 56 states and 65 transitions. [2019-09-05 11:29:42,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-05 11:29:42,327 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 32 [2019-09-05 11:29:42,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:42,329 INFO L225 Difference]: With dead ends: 56 [2019-09-05 11:29:42,329 INFO L226 Difference]: Without dead ends: 42 [2019-09-05 11:29:42,329 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-09-05 11:29:42,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2019-09-05 11:29:42,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2019-09-05 11:29:42,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2019-09-05 11:29:42,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 39 transitions. [2019-09-05 11:29:42,341 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 39 transitions. Word has length 32 [2019-09-05 11:29:42,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:42,342 INFO L475 AbstractCegarLoop]: Abstraction has 35 states and 39 transitions. [2019-09-05 11:29:42,342 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-05 11:29:42,342 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 39 transitions. [2019-09-05 11:29:42,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-05 11:29:42,343 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:42,343 INFO L399 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:42,344 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:42,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:42,344 INFO L82 PathProgramCache]: Analyzing trace with hash -465646740, now seen corresponding path program 3 times [2019-09-05 11:29:42,344 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:42,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:42,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:42,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:42,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:42,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:42,881 WARN L188 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 225 DAG size of output: 37 [2019-09-05 11:29:43,299 WARN L188 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 48 [2019-09-05 11:29:44,087 WARN L188 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 40 [2019-09-05 11:29:44,095 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:44,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:44,095 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:44,107 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:29:44,210 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2019-09-05 11:29:44,210 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:44,212 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 33 conjunts are in the unsatisfiable core [2019-09-05 11:29:44,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:44,233 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:29:44,234 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:44,291 INFO L567 ElimStorePlain]: treesize reduction 195, result has 12.2 percent of original size [2019-09-05 11:29:44,295 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-09-05 11:29:44,295 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:29:44,303 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:29:44,303 INFO L464 ElimStorePlain]: Eliminatee v_prenex_6 vanished before elimination [2019-09-05 11:29:44,304 INFO L464 ElimStorePlain]: Eliminatee v_prenex_7 vanished before elimination [2019-09-05 11:29:44,304 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:29:44,304 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:275, output treesize:23 [2019-09-05 11:29:44,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:44,602 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:44,604 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:44,605 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:44,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:46,800 WARN L188 SmtUtils]: Spent 2.11 s on a formula simplification. DAG size of input: 50 DAG size of output: 39 [2019-09-05 11:29:46,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:29:47,138 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:47,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:47,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 24 [2019-09-05 11:29:47,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-09-05 11:29:47,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-09-05 11:29:47,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2019-09-05 11:29:47,144 INFO L87 Difference]: Start difference. First operand 35 states and 39 transitions. Second operand 24 states. [2019-09-05 11:29:49,886 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 50 [2019-09-05 11:29:51,320 WARN L188 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 89 DAG size of output: 79 [2019-09-05 11:29:53,428 WARN L188 SmtUtils]: Spent 279.00 ms on a formula simplification. DAG size of input: 114 DAG size of output: 90 [2019-09-05 11:29:53,597 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 68 [2019-09-05 11:29:53,818 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 83 [2019-09-05 11:29:54,054 WARN L188 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 77 [2019-09-05 11:29:54,297 WARN L188 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 89 [2019-09-05 11:29:54,509 WARN L188 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 72 [2019-09-05 11:29:54,748 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 74 [2019-09-05 11:29:55,154 WARN L188 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 68 [2019-09-05 11:29:55,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:55,708 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2019-09-05 11:29:55,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-09-05 11:29:55,710 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 32 [2019-09-05 11:29:55,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:55,711 INFO L225 Difference]: With dead ends: 69 [2019-09-05 11:29:55,711 INFO L226 Difference]: Without dead ends: 39 [2019-09-05 11:29:55,712 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 24 SyntacticMatches, 4 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 221 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=218, Invalid=1421, Unknown=1, NotChecked=0, Total=1640 [2019-09-05 11:29:55,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-09-05 11:29:55,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 37. [2019-09-05 11:29:55,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-09-05 11:29:55,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2019-09-05 11:29:55,718 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 32 [2019-09-05 11:29:55,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:55,719 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2019-09-05 11:29:55,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-09-05 11:29:55,719 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2019-09-05 11:29:55,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 11:29:55,719 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:55,720 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:55,720 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:55,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:55,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1595152954, now seen corresponding path program 3 times [2019-09-05 11:29:55,720 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:55,720 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:55,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:55,721 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:55,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:55,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:55,803 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:55,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:55,804 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:55,816 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-09-05 11:29:55,912 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-09-05 11:29:55,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:55,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2019-09-05 11:29:55,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:55,934 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:55,938 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:29:55,938 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-09-05 11:29:55,938 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-05 11:29:55,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-05 11:29:55,939 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:29:55,939 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 8 states. [2019-09-05 11:29:56,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:29:56,044 INFO L93 Difference]: Finished difference Result 60 states and 69 transitions. [2019-09-05 11:29:56,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-05 11:29:56,044 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 36 [2019-09-05 11:29:56,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:29:56,045 INFO L225 Difference]: With dead ends: 60 [2019-09-05 11:29:56,045 INFO L226 Difference]: Without dead ends: 46 [2019-09-05 11:29:56,046 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-09-05 11:29:56,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-09-05 11:29:56,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2019-09-05 11:29:56,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2019-09-05 11:29:56,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 43 transitions. [2019-09-05 11:29:56,053 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 43 transitions. Word has length 36 [2019-09-05 11:29:56,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:29:56,055 INFO L475 AbstractCegarLoop]: Abstraction has 39 states and 43 transitions. [2019-09-05 11:29:56,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-05 11:29:56,056 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 43 transitions. [2019-09-05 11:29:56,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-09-05 11:29:56,056 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:29:56,056 INFO L399 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:29:56,057 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:29:56,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:29:56,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1336987516, now seen corresponding path program 4 times [2019-09-05 11:29:56,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:29:56,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:29:56,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:56,058 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:29:56,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:29:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:29:56,433 WARN L188 SmtUtils]: Spent 179.00 ms on a formula simplification. DAG size of input: 168 DAG size of output: 31 [2019-09-05 11:29:56,780 WARN L188 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 48 [2019-09-05 11:29:56,975 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 51 [2019-09-05 11:29:57,262 WARN L188 SmtUtils]: Spent 227.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 68 [2019-09-05 11:29:57,470 WARN L188 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2019-09-05 11:29:57,916 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:29:57,916 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:29:57,916 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:29:57,929 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-09-05 11:29:58,016 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:29:58,016 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:29:58,017 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 48 conjunts are in the unsatisfiable core [2019-09-05 11:29:58,020 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:29:58,039 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-09-05 11:29:58,039 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:04,111 WARN L188 SmtUtils]: Spent 6.07 s on a formula simplification. DAG size of input: 53 DAG size of output: 21 [2019-09-05 11:30:04,112 INFO L567 ElimStorePlain]: treesize reduction 197, result has 12.1 percent of original size [2019-09-05 11:30:04,115 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2019-09-05 11:30:04,115 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-09-05 11:30:04,120 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-09-05 11:30:04,121 INFO L464 ElimStorePlain]: Eliminatee v_prenex_11 vanished before elimination [2019-09-05 11:30:04,121 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_8| vanished before elimination [2019-09-05 11:30:04,122 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-09-05 11:30:04,122 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:275, output treesize:23 [2019-09-05 11:30:04,724 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2019-09-05 11:30:05,049 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 52 [2019-09-05 11:30:05,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:05,051 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:05,052 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:05,053 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:05,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-09-05 11:30:05,322 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2019-09-05 11:30:05,647 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 54 [2019-09-05 11:30:06,309 WARN L188 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 55 [2019-09-05 11:30:06,511 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:06,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:06,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18] total 31 [2019-09-05 11:30:06,516 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-09-05 11:30:06,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-09-05 11:30:06,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=831, Unknown=0, NotChecked=0, Total=930 [2019-09-05 11:30:06,517 INFO L87 Difference]: Start difference. First operand 39 states and 43 transitions. Second operand 31 states. [2019-09-05 11:30:10,044 WARN L188 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 74 [2019-09-05 11:30:10,249 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 80 [2019-09-05 11:30:10,691 WARN L188 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 128 DAG size of output: 88 [2019-09-05 11:30:10,888 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 81 [2019-09-05 11:30:11,262 WARN L188 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 66 [2019-09-05 11:30:11,481 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 63 [2019-09-05 11:30:11,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:11,914 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2019-09-05 11:30:11,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-09-05 11:30:11,915 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 36 [2019-09-05 11:30:11,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:11,916 INFO L225 Difference]: With dead ends: 75 [2019-09-05 11:30:11,917 INFO L226 Difference]: Without dead ends: 43 [2019-09-05 11:30:11,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 21 SyntacticMatches, 6 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=273, Invalid=2177, Unknown=0, NotChecked=0, Total=2450 [2019-09-05 11:30:11,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-09-05 11:30:11,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-09-05 11:30:11,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-09-05 11:30:11,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2019-09-05 11:30:11,929 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 36 [2019-09-05 11:30:11,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:11,929 INFO L475 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2019-09-05 11:30:11,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-09-05 11:30:11,929 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2019-09-05 11:30:11,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 11:30:11,930 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:11,930 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:11,930 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:11,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:11,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1972633310, now seen corresponding path program 4 times [2019-09-05 11:30:11,931 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:11,931 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:11,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:11,932 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:11,932 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:11,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:12,025 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:12,025 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-05 11:30:12,025 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) [2019-09-05 11:30:12,038 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-05 11:30:12,065 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-09-05 11:30:12,065 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-05 11:30:12,066 INFO L256 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 14 conjunts are in the unsatisfiable core [2019-09-05 11:30:12,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-05 11:30:12,095 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-05 11:30:12,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-05 11:30:12,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-09-05 11:30:12,099 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-09-05 11:30:12,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-09-05 11:30:12,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:30:12,100 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 9 states. [2019-09-05 11:30:12,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-05 11:30:12,226 INFO L93 Difference]: Finished difference Result 64 states and 72 transitions. [2019-09-05 11:30:12,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-05 11:30:12,226 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-09-05 11:30:12,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-05 11:30:12,228 INFO L225 Difference]: With dead ends: 64 [2019-09-05 11:30:12,228 INFO L226 Difference]: Without dead ends: 50 [2019-09-05 11:30:12,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-05 11:30:12,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-09-05 11:30:12,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2019-09-05 11:30:12,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2019-09-05 11:30:12,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 46 transitions. [2019-09-05 11:30:12,237 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 46 transitions. Word has length 40 [2019-09-05 11:30:12,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-05 11:30:12,237 INFO L475 AbstractCegarLoop]: Abstraction has 43 states and 46 transitions. [2019-09-05 11:30:12,237 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-09-05 11:30:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 46 transitions. [2019-09-05 11:30:12,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-09-05 11:30:12,238 INFO L391 BasicCegarLoop]: Found error trace [2019-09-05 11:30:12,238 INFO L399 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-05 11:30:12,238 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-05 11:30:12,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-05 11:30:12,239 INFO L82 PathProgramCache]: Analyzing trace with hash -2064168548, now seen corresponding path program 5 times [2019-09-05 11:30:12,239 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-05 11:30:12,239 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-05 11:30:12,239 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:12,240 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-05 11:30:12,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-05 11:30:12,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-05 11:30:12,396 ERROR L253 erpolLogProxyWrapper]: Interpolant 29 not inductive: (Check returned sat) [2019-09-05 11:30:12,428 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: generated interpolants did not pass sanity check at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:969) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:168) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:271) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:207) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:109) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:211) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:183) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:453) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:429) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:371) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:332) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:170) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:122) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-09-05 11:30:12,433 INFO L168 Benchmark]: Toolchain (without parser) took 57762.03 ms. Allocated memory was 131.6 MB in the beginning and 402.7 MB in the end (delta: 271.1 MB). Free memory was 87.1 MB in the beginning and 78.3 MB in the end (delta: 8.8 MB). Peak memory consumption was 279.9 MB. Max. memory is 7.1 GB. [2019-09-05 11:30:12,434 INFO L168 Benchmark]: CDTParser took 0.44 ms. Allocated memory is still 131.6 MB. Free memory was 105.8 MB in the beginning and 105.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-09-05 11:30:12,435 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.10 ms. Allocated memory was 131.6 MB in the beginning and 198.7 MB in the end (delta: 67.1 MB). Free memory was 86.9 MB in the beginning and 176.1 MB in the end (delta: -89.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. [2019-09-05 11:30:12,435 INFO L168 Benchmark]: Boogie Preprocessor took 32.21 ms. Allocated memory is still 198.7 MB. Free memory was 176.1 MB in the beginning and 173.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-09-05 11:30:12,436 INFO L168 Benchmark]: RCFGBuilder took 325.09 ms. Allocated memory is still 198.7 MB. Free memory was 173.8 MB in the beginning and 157.9 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. [2019-09-05 11:30:12,437 INFO L168 Benchmark]: TraceAbstraction took 57035.47 ms. Allocated memory was 198.7 MB in the beginning and 402.7 MB in the end (delta: 203.9 MB). Free memory was 157.9 MB in the beginning and 78.3 MB in the end (delta: 79.6 MB). Peak memory consumption was 283.6 MB. Max. memory is 7.1 GB. [2019-09-05 11:30:12,440 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.44 ms. Allocated memory is still 131.6 MB. Free memory was 105.8 MB in the beginning and 105.6 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 365.10 ms. Allocated memory was 131.6 MB in the beginning and 198.7 MB in the end (delta: 67.1 MB). Free memory was 86.9 MB in the beginning and 176.1 MB in the end (delta: -89.2 MB). Peak memory consumption was 25.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.21 ms. Allocated memory is still 198.7 MB. Free memory was 176.1 MB in the beginning and 173.8 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 325.09 ms. Allocated memory is still 198.7 MB. Free memory was 173.8 MB in the beginning and 157.9 MB in the end (delta: 15.9 MB). Peak memory consumption was 15.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 57035.47 ms. Allocated memory was 198.7 MB in the beginning and 402.7 MB in the end (delta: 203.9 MB). Free memory was 157.9 MB in the beginning and 78.3 MB in the end (delta: 79.6 MB). Peak memory consumption was 283.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: SMTLIBException: generated interpolants did not pass sanity check de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: SMTLIBException: generated interpolants did not pass sanity check: de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:969) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...