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/array-examples/standard_reverse_ground.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-01 23:26:56,511 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-01 23:26:56,514 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-01 23:26:56,526 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-01 23:26:56,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-01 23:26:56,527 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-01 23:26:56,529 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-01 23:26:56,530 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-01 23:26:56,532 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-01 23:26:56,533 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-01 23:26:56,534 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-01 23:26:56,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-01 23:26:56,536 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-01 23:26:56,537 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-01 23:26:56,538 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-01 23:26:56,539 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-01 23:26:56,540 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-01 23:26:56,541 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-01 23:26:56,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-01 23:26:56,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-01 23:26:56,546 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-01 23:26:56,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-01 23:26:56,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-01 23:26:56,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-01 23:26:56,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-01 23:26:56,556 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-01 23:26:56,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-01 23:26:56,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-01 23:26:56,559 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-01 23:26:56,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-01 23:26:56,561 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-01 23:26:56,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-01 23:26:56,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-01 23:26:56,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-01 23:26:56,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-01 23:26:56,567 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-01 23:26:56,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-01 23:26:56,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-01 23:26:56,568 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-01 23:26:56,572 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-01 23:26:56,574 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-01 23:26:56,575 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-10-01 23:26:56,602 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-01 23:26:56,603 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-01 23:26:56,605 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-01 23:26:56,605 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-01 23:26:56,606 INFO L138 SettingsManager]: * Use SBE=true [2019-10-01 23:26:56,606 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-01 23:26:56,607 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-01 23:26:56,607 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-01 23:26:56,607 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-01 23:26:56,607 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-01 23:26:56,608 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-01 23:26:56,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-01 23:26:56,609 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-01 23:26:56,609 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-01 23:26:56,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-01 23:26:56,610 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-01 23:26:56,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-01 23:26:56,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-01 23:26:56,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-01 23:26:56,611 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-01 23:26:56,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-01 23:26:56,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-01 23:26:56,612 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-01 23:26:56,612 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-01 23:26:56,612 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-01 23:26:56,612 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-01 23:26:56,613 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-01 23:26:56,613 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-01 23:26:56,613 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-01 23:26:56,665 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-01 23:26:56,677 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-01 23:26:56,681 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-01 23:26:56,683 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-01 23:26:56,683 INFO L275 PluginConnector]: CDTParser initialized [2019-10-01 23:26:56,684 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-examples/standard_reverse_ground.i [2019-10-01 23:26:56,745 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a7f0ab7f/6cd04a33aaa5450d8d4e8424211eb5f1/FLAGd007c4293 [2019-10-01 23:26:57,172 INFO L306 CDTParser]: Found 1 translation units. [2019-10-01 23:26:57,172 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-examples/standard_reverse_ground.i [2019-10-01 23:26:57,179 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a7f0ab7f/6cd04a33aaa5450d8d4e8424211eb5f1/FLAGd007c4293 [2019-10-01 23:26:57,595 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a7f0ab7f/6cd04a33aaa5450d8d4e8424211eb5f1 [2019-10-01 23:26:57,606 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-01 23:26:57,611 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-01 23:26:57,612 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-01 23:26:57,612 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-01 23:26:57,617 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-01 23:26:57,618 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:26:57" (1/1) ... [2019-10-01 23:26:57,621 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46029d64 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:57, skipping insertion in model container [2019-10-01 23:26:57,621 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.10 11:26:57" (1/1) ... [2019-10-01 23:26:57,629 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-01 23:26:57,645 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-01 23:26:57,826 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:26:57,829 INFO L188 MainTranslator]: Completed pre-run [2019-10-01 23:26:57,850 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-01 23:26:57,869 INFO L192 MainTranslator]: Completed translation [2019-10-01 23:26:57,869 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:57 WrapperNode [2019-10-01 23:26:57,870 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-01 23:26:57,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-01 23:26:57,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-01 23:26:57,871 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-01 23:26:57,967 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:57" (1/1) ... [2019-10-01 23:26:57,967 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:57" (1/1) ... [2019-10-01 23:26:57,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:57" (1/1) ... [2019-10-01 23:26:57,974 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:57" (1/1) ... [2019-10-01 23:26:57,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:57" (1/1) ... [2019-10-01 23:26:57,987 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:57" (1/1) ... [2019-10-01 23:26:57,988 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:57" (1/1) ... [2019-10-01 23:26:57,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-01 23:26:57,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-01 23:26:57,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-01 23:26:57,991 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-01 23:26:57,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:57" (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-10-01 23:26:58,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-01 23:26:58,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-01 23:26:58,049 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-01 23:26:58,049 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-01 23:26:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-01 23:26:58,049 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-01 23:26:58,050 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-01 23:26:58,050 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-01 23:26:58,050 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-01 23:26:58,050 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-01 23:26:58,050 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-01 23:26:58,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-01 23:26:58,050 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-01 23:26:58,051 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-01 23:26:58,312 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-01 23:26:58,319 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-10-01 23:26:58,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:26:58 BoogieIcfgContainer [2019-10-01 23:26:58,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-01 23:26:58,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-01 23:26:58,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-01 23:26:58,337 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-01 23:26:58,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.10 11:26:57" (1/3) ... [2019-10-01 23:26:58,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247f8ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:26:58, skipping insertion in model container [2019-10-01 23:26:58,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.10 11:26:57" (2/3) ... [2019-10-01 23:26:58,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@247f8ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.10 11:26:58, skipping insertion in model container [2019-10-01 23:26:58,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.10 11:26:58" (3/3) ... [2019-10-01 23:26:58,350 INFO L109 eAbstractionObserver]: Analyzing ICFG standard_reverse_ground.i [2019-10-01 23:26:58,383 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-01 23:26:58,400 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-01 23:26:58,443 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-01 23:26:58,476 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-01 23:26:58,477 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-01 23:26:58,477 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-01 23:26:58,477 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-01 23:26:58,477 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-01 23:26:58,477 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-01 23:26:58,478 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-01 23:26:58,478 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-01 23:26:58,478 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-01 23:26:58,498 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states. [2019-10-01 23:26:58,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 23:26:58,506 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:58,507 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:58,509 INFO L418 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:58,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:58,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1778002988, now seen corresponding path program 1 times [2019-10-01 23:26:58,518 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:58,519 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:58,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:58,572 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:58,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:58,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:58,656 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:26:58,658 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:26:58,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-01 23:26:58,661 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-01 23:26:58,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-01 23:26:58,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-01 23:26:58,680 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 2 states. [2019-10-01 23:26:58,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:58,717 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2019-10-01 23:26:58,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-01 23:26:58,719 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 15 [2019-10-01 23:26:58,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:58,728 INFO L225 Difference]: With dead ends: 46 [2019-10-01 23:26:58,728 INFO L226 Difference]: Without dead ends: 22 [2019-10-01 23:26:58,732 INFO L640 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-10-01 23:26:58,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-10-01 23:26:58,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-10-01 23:26:58,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-10-01 23:26:58,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2019-10-01 23:26:58,782 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 15 [2019-10-01 23:26:58,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:58,783 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2019-10-01 23:26:58,783 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-01 23:26:58,783 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2019-10-01 23:26:58,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-10-01 23:26:58,784 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:58,784 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:58,785 INFO L418 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:58,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:58,786 INFO L82 PathProgramCache]: Analyzing trace with hash -262172122, now seen corresponding path program 1 times [2019-10-01 23:26:58,786 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:58,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:58,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:58,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:58,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:58,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:58,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-01 23:26:58,852 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-01 23:26:58,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-01 23:26:58,854 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-01 23:26:58,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-01 23:26:58,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:26:58,855 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand 3 states. [2019-10-01 23:26:58,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:58,943 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2019-10-01 23:26:58,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-01 23:26:58,945 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-10-01 23:26:58,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:58,947 INFO L225 Difference]: With dead ends: 40 [2019-10-01 23:26:58,947 INFO L226 Difference]: Without dead ends: 26 [2019-10-01 23:26:58,948 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-01 23:26:58,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2019-10-01 23:26:58,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2019-10-01 23:26:58,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-10-01 23:26:58,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2019-10-01 23:26:58,963 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 15 [2019-10-01 23:26:58,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:58,964 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2019-10-01 23:26:58,964 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-01 23:26:58,965 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2019-10-01 23:26:58,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-10-01 23:26:58,966 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:58,966 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:58,967 INFO L418 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:58,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:58,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1323409058, now seen corresponding path program 1 times [2019-10-01 23:26:58,967 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:58,968 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:58,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:58,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:58,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:59,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:59,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:26:59,134 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:59,135 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:59,170 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:59,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-01 23:26:59,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:59,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-01 23:26:59,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:59,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-10-01 23:26:59,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-01 23:26:59,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-01 23:26:59,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:26:59,260 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand 5 states. [2019-10-01 23:26:59,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:59,319 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2019-10-01 23:26:59,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-01 23:26:59,320 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-10-01 23:26:59,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:59,321 INFO L225 Difference]: With dead ends: 45 [2019-10-01 23:26:59,322 INFO L226 Difference]: Without dead ends: 30 [2019-10-01 23:26:59,322 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-10-01 23:26:59,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-10-01 23:26:59,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2019-10-01 23:26:59,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-10-01 23:26:59,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2019-10-01 23:26:59,329 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 19 [2019-10-01 23:26:59,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:59,329 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2019-10-01 23:26:59,329 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-01 23:26:59,330 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2019-10-01 23:26:59,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-10-01 23:26:59,330 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:59,331 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:59,331 INFO L418 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:59,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:59,332 INFO L82 PathProgramCache]: Analyzing trace with hash 1582955806, now seen corresponding path program 2 times [2019-10-01 23:26:59,332 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:59,332 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:59,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:59,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:26:59,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:59,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:59,444 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-01 23:26:59,444 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:59,444 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:59,464 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:26:59,493 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:26:59,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:59,495 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-01 23:26:59,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:59,517 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-01 23:26:59,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:26:59,525 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2019-10-01 23:26:59,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-01 23:26:59,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-01 23:26:59,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:26:59,527 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 6 states. [2019-10-01 23:26:59,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:26:59,600 INFO L93 Difference]: Finished difference Result 51 states and 56 transitions. [2019-10-01 23:26:59,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-01 23:26:59,601 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2019-10-01 23:26:59,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:26:59,602 INFO L225 Difference]: With dead ends: 51 [2019-10-01 23:26:59,602 INFO L226 Difference]: Without dead ends: 34 [2019-10-01 23:26:59,603 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-10-01 23:26:59,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2019-10-01 23:26:59,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2019-10-01 23:26:59,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-10-01 23:26:59,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2019-10-01 23:26:59,610 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 23 [2019-10-01 23:26:59,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:26:59,610 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2019-10-01 23:26:59,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-01 23:26:59,611 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2019-10-01 23:26:59,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-10-01 23:26:59,612 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:26:59,614 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:26:59,615 INFO L418 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:26:59,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:26:59,615 INFO L82 PathProgramCache]: Analyzing trace with hash -657216102, now seen corresponding path program 3 times [2019-10-01 23:26:59,615 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:26:59,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:26:59,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:59,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:26:59,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:26:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:26:59,760 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-10-01 23:26:59,761 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:26:59,761 INFO L224 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) [2019-10-01 23:26:59,789 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:26:59,823 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2019-10-01 23:26:59,823 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:26:59,825 INFO L256 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:26:59,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:26:59,906 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:26:59,907 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:59,921 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:59,922 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:26:59,922 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-01 23:26:59,957 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-10-01 23:26:59,958 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:26:59,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:26:59,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:26:59,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:38, output treesize:34 [2019-10-01 23:27:00,158 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 23:27:00,159 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 23:27:00,162 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 10 [2019-10-01 23:27:00,163 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:00,171 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:27:00,172 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:27:00,173 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:42, output treesize:3 [2019-10-01 23:27:00,243 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2019-10-01 23:27:00,249 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-01 23:27:00,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [6] total 14 [2019-10-01 23:27:00,250 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:27:00,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:27:00,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:27:00,251 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 14 states. [2019-10-01 23:27:01,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:01,033 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2019-10-01 23:27:01,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-10-01 23:27:01,035 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 27 [2019-10-01 23:27:01,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:01,036 INFO L225 Difference]: With dead ends: 65 [2019-10-01 23:27:01,036 INFO L226 Difference]: Without dead ends: 46 [2019-10-01 23:27:01,038 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=172, Invalid=640, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:27:01,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2019-10-01 23:27:01,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2019-10-01 23:27:01,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-10-01 23:27:01,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 44 transitions. [2019-10-01 23:27:01,049 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 44 transitions. Word has length 27 [2019-10-01 23:27:01,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:01,050 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 44 transitions. [2019-10-01 23:27:01,050 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:27:01,050 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 44 transitions. [2019-10-01 23:27:01,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-01 23:27:01,051 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:01,052 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:01,052 INFO L418 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:01,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:01,052 INFO L82 PathProgramCache]: Analyzing trace with hash 395701069, now seen corresponding path program 1 times [2019-10-01 23:27:01,053 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:01,053 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:01,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:01,055 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:01,055 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:01,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:01,162 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 16 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-01 23:27:01,163 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:01,163 INFO L224 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-10-01 23:27:01,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:27:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:01,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 6 conjunts are in the unsatisfiable core [2019-10-01 23:27:01,230 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:01,257 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-10-01 23:27:01,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:01,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-10-01 23:27:01,266 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-01 23:27:01,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-01 23:27:01,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:27:01,267 INFO L87 Difference]: Start difference. First operand 42 states and 44 transitions. Second operand 8 states. [2019-10-01 23:27:01,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:01,341 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2019-10-01 23:27:01,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-01 23:27:01,342 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-10-01 23:27:01,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:01,345 INFO L225 Difference]: With dead ends: 75 [2019-10-01 23:27:01,345 INFO L226 Difference]: Without dead ends: 48 [2019-10-01 23:27:01,346 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-10-01 23:27:01,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-10-01 23:27:01,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2019-10-01 23:27:01,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2019-10-01 23:27:01,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2019-10-01 23:27:01,355 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 39 [2019-10-01 23:27:01,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:01,356 INFO L475 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2019-10-01 23:27:01,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-01 23:27:01,356 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2019-10-01 23:27:01,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-10-01 23:27:01,357 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:01,358 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:01,358 INFO L418 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:01,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:01,358 INFO L82 PathProgramCache]: Analyzing trace with hash 885326793, now seen corresponding path program 2 times [2019-10-01 23:27:01,359 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:01,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:01,362 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:01,363 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:27:01,363 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:01,436 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 25 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-01 23:27:01,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:01,436 INFO L224 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-10-01 23:27:01,469 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:27:01,510 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:27:01,510 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:01,511 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 7 conjunts are in the unsatisfiable core [2019-10-01 23:27:01,516 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:01,545 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-01 23:27:01,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:01,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-10-01 23:27:01,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-01 23:27:01,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-01 23:27:01,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:27:01,552 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand 9 states. [2019-10-01 23:27:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:01,626 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2019-10-01 23:27:01,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-01 23:27:01,626 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 43 [2019-10-01 23:27:01,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:01,627 INFO L225 Difference]: With dead ends: 81 [2019-10-01 23:27:01,628 INFO L226 Difference]: Without dead ends: 52 [2019-10-01 23:27:01,628 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-10-01 23:27:01,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-10-01 23:27:01,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 50. [2019-10-01 23:27:01,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2019-10-01 23:27:01,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 52 transitions. [2019-10-01 23:27:01,638 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 52 transitions. Word has length 43 [2019-10-01 23:27:01,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:01,638 INFO L475 AbstractCegarLoop]: Abstraction has 50 states and 52 transitions. [2019-10-01 23:27:01,638 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-01 23:27:01,639 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 52 transitions. [2019-10-01 23:27:01,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-01 23:27:01,640 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:01,640 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:01,640 INFO L418 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:01,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:01,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1113297339, now seen corresponding path program 3 times [2019-10-01 23:27:01,641 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:01,643 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:01,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:01,645 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:01,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:01,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 2 proven. 36 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-01 23:27:01,768 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:01,768 INFO L224 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-10-01 23:27:01,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:27:01,830 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2019-10-01 23:27:01,831 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:01,832 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:27:01,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:01,850 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:27:01,851 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:01,854 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:27:01,855 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:27:01,855 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:8 [2019-10-01 23:27:01,874 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-10-01 23:27:01,874 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:01,881 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:27:01,882 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:27:01,882 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:32, output treesize:28 [2019-10-01 23:27:01,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:27:01,944 INFO L341 Elim1Store]: treesize reduction 40, result has 23.1 percent of original size [2019-10-01 23:27:01,948 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 51 [2019-10-01 23:27:01,950 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:01,964 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:27:01,964 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:27:01,965 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-10-01 23:27:04,148 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_1| Int) (v_main_~i~0_26 Int) (|v_main_~#b~0.offset_BEFORE_CALL_1| Int) (|v_main_~#a~0.base_BEFORE_CALL_1| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_1|)) (.cse3 (* (- 4) v_main_~i~0_26)) (.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_1|)) (.cse1 (* 4 v_main_~i~0_26))) (and (< v_main_~i~0_26 100000) (not (= |v_main_~#b~0.base_BEFORE_CALL_1| |v_main_~#a~0.base_BEFORE_CALL_1|)) (<= 99999 v_main_~i~0_26) (= (select .cse0 (+ .cse1 |v_main_~#b~0.offset_BEFORE_CALL_1| (- 4))) (select .cse2 (+ .cse3 400000))) (= (select .cse2 (+ .cse3 399996)) (select .cse0 (+ .cse1 |v_main_~#b~0.offset_BEFORE_CALL_1|)))))) is different from true [2019-10-01 23:27:06,196 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 35 [2019-10-01 23:27:08,232 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 36 [2019-10-01 23:27:08,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:27:08,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:27:08,360 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 23:27:08,386 INFO L341 Elim1Store]: treesize reduction 17, result has 63.8 percent of original size [2019-10-01 23:27:08,387 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 2 disjoint index pairs (out of 15 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 42 [2019-10-01 23:27:08,389 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2019-10-01 23:27:08,411 INFO L567 ElimStorePlain]: treesize reduction 12, result has 53.8 percent of original size [2019-10-01 23:27:08,413 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:27:08,413 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:66, output treesize:3 [2019-10-01 23:27:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 19 proven. 4 refuted. 0 times theorem prover too weak. 52 trivial. 1 not checked. [2019-10-01 23:27:10,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:10,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16] total 23 [2019-10-01 23:27:10,533 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:27:10,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:27:10,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=388, Unknown=2, NotChecked=40, Total=506 [2019-10-01 23:27:10,541 INFO L87 Difference]: Start difference. First operand 50 states and 52 transitions. Second operand 23 states. [2019-10-01 23:27:17,802 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 38 DAG size of output: 35 [2019-10-01 23:27:21,846 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 41 DAG size of output: 37 [2019-10-01 23:27:24,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:24,201 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2019-10-01 23:27:24,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 23:27:24,202 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 47 [2019-10-01 23:27:24,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:24,203 INFO L225 Difference]: With dead ends: 97 [2019-10-01 23:27:24,204 INFO L226 Difference]: Without dead ends: 66 [2019-10-01 23:27:24,206 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 570 ImplicationChecksByTransitivity, 19.5s TimeCoverageRelationStatistics Valid=440, Invalid=2011, Unknown=3, NotChecked=96, Total=2550 [2019-10-01 23:27:24,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2019-10-01 23:27:24,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 62. [2019-10-01 23:27:24,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2019-10-01 23:27:24,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 64 transitions. [2019-10-01 23:27:24,218 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 64 transitions. Word has length 47 [2019-10-01 23:27:24,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:24,218 INFO L475 AbstractCegarLoop]: Abstraction has 62 states and 64 transitions. [2019-10-01 23:27:24,218 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:27:24,219 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 64 transitions. [2019-10-01 23:27:24,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-10-01 23:27:24,220 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:24,220 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:24,220 INFO L418 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:24,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:24,221 INFO L82 PathProgramCache]: Analyzing trace with hash 1452772088, now seen corresponding path program 4 times [2019-10-01 23:27:24,221 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:24,221 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:24,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:24,223 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:24,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:24,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:24,322 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 4 proven. 49 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-01 23:27:24,322 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:24,322 INFO L224 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-10-01 23:27:24,361 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:27:24,404 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:27:24,405 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:24,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 167 conjuncts, 9 conjunts are in the unsatisfiable core [2019-10-01 23:27:24,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:24,442 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2019-10-01 23:27:24,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:24,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-10-01 23:27:24,449 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-10-01 23:27:24,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-10-01 23:27:24,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:27:24,450 INFO L87 Difference]: Start difference. First operand 62 states and 64 transitions. Second operand 11 states. [2019-10-01 23:27:24,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:24,547 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2019-10-01 23:27:24,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-01 23:27:24,548 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 59 [2019-10-01 23:27:24,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:24,551 INFO L225 Difference]: With dead ends: 109 [2019-10-01 23:27:24,551 INFO L226 Difference]: Without dead ends: 68 [2019-10-01 23:27:24,554 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-10-01 23:27:24,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-10-01 23:27:24,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 66. [2019-10-01 23:27:24,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2019-10-01 23:27:24,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 68 transitions. [2019-10-01 23:27:24,578 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 68 transitions. Word has length 59 [2019-10-01 23:27:24,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:24,578 INFO L475 AbstractCegarLoop]: Abstraction has 66 states and 68 transitions. [2019-10-01 23:27:24,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-10-01 23:27:24,578 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 68 transitions. [2019-10-01 23:27:24,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2019-10-01 23:27:24,579 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:24,580 INFO L411 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:24,580 INFO L418 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:24,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:24,580 INFO L82 PathProgramCache]: Analyzing trace with hash -709862028, now seen corresponding path program 5 times [2019-10-01 23:27:24,580 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:24,580 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:24,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:24,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:24,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:24,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:24,712 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 4 proven. 64 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2019-10-01 23:27:24,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:24,712 INFO L224 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-10-01 23:27:24,738 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:27:25,290 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 9 check-sat command(s) [2019-10-01 23:27:25,290 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:25,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 10 conjunts are in the unsatisfiable core [2019-10-01 23:27:25,296 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:25,310 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2019-10-01 23:27:25,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:25,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-10-01 23:27:25,319 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-01 23:27:25,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-01 23:27:25,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:27:25,321 INFO L87 Difference]: Start difference. First operand 66 states and 68 transitions. Second operand 12 states. [2019-10-01 23:27:25,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:25,430 INFO L93 Difference]: Finished difference Result 115 states and 120 transitions. [2019-10-01 23:27:25,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-01 23:27:25,431 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 63 [2019-10-01 23:27:25,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:25,432 INFO L225 Difference]: With dead ends: 115 [2019-10-01 23:27:25,432 INFO L226 Difference]: Without dead ends: 72 [2019-10-01 23:27:25,433 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-10-01 23:27:25,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2019-10-01 23:27:25,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 70. [2019-10-01 23:27:25,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2019-10-01 23:27:25,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 72 transitions. [2019-10-01 23:27:25,444 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 72 transitions. Word has length 63 [2019-10-01 23:27:25,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:25,444 INFO L475 AbstractCegarLoop]: Abstraction has 70 states and 72 transitions. [2019-10-01 23:27:25,445 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-01 23:27:25,445 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 72 transitions. [2019-10-01 23:27:25,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-10-01 23:27:25,446 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:25,446 INFO L411 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:25,446 INFO L418 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:25,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:25,447 INFO L82 PathProgramCache]: Analyzing trace with hash -1364688400, now seen corresponding path program 6 times [2019-10-01 23:27:25,447 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:25,447 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:25,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:25,448 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:25,448 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:25,567 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 4 proven. 81 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2019-10-01 23:27:25,568 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:25,568 INFO L224 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-10-01 23:27:25,594 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:26,037 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2019-10-01 23:27:26,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:26,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:27:26,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:26,070 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2019-10-01 23:27:26,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:26,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-10-01 23:27:26,083 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-10-01 23:27:26,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-10-01 23:27:26,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:27:26,084 INFO L87 Difference]: Start difference. First operand 70 states and 72 transitions. Second operand 13 states. [2019-10-01 23:27:26,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:26,192 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2019-10-01 23:27:26,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-01 23:27:26,193 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-10-01 23:27:26,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:26,194 INFO L225 Difference]: With dead ends: 121 [2019-10-01 23:27:26,194 INFO L226 Difference]: Without dead ends: 76 [2019-10-01 23:27:26,195 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-10-01 23:27:26,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-10-01 23:27:26,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 74. [2019-10-01 23:27:26,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2019-10-01 23:27:26,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 76 transitions. [2019-10-01 23:27:26,207 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 76 transitions. Word has length 67 [2019-10-01 23:27:26,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:26,208 INFO L475 AbstractCegarLoop]: Abstraction has 74 states and 76 transitions. [2019-10-01 23:27:26,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-10-01 23:27:26,208 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 76 transitions. [2019-10-01 23:27:26,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-10-01 23:27:26,209 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:26,210 INFO L411 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:26,210 INFO L418 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:26,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:26,210 INFO L82 PathProgramCache]: Analyzing trace with hash -2146764692, now seen corresponding path program 7 times [2019-10-01 23:27:26,211 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:26,211 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:26,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:26,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:26,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:26,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:26,356 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 4 proven. 100 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-01 23:27:26,356 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:26,356 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:26,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:27:26,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:26,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 12 conjunts are in the unsatisfiable core [2019-10-01 23:27:26,412 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:26,429 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (11)] Exception during sending of exit command (exit): Broken pipe [2019-10-01 23:27:26,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:26,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 14 [2019-10-01 23:27:26,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-10-01 23:27:26,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-10-01 23:27:26,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:27:26,444 INFO L87 Difference]: Start difference. First operand 74 states and 76 transitions. Second operand 14 states. [2019-10-01 23:27:26,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:26,563 INFO L93 Difference]: Finished difference Result 127 states and 132 transitions. [2019-10-01 23:27:26,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-01 23:27:26,564 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 71 [2019-10-01 23:27:26,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:26,565 INFO L225 Difference]: With dead ends: 127 [2019-10-01 23:27:26,565 INFO L226 Difference]: Without dead ends: 80 [2019-10-01 23:27:26,566 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-10-01 23:27:26,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2019-10-01 23:27:26,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 78. [2019-10-01 23:27:26,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2019-10-01 23:27:26,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 80 transitions. [2019-10-01 23:27:26,576 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 80 transitions. Word has length 71 [2019-10-01 23:27:26,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:26,576 INFO L475 AbstractCegarLoop]: Abstraction has 78 states and 80 transitions. [2019-10-01 23:27:26,576 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-10-01 23:27:26,577 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 80 transitions. [2019-10-01 23:27:26,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-10-01 23:27:26,578 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:26,578 INFO L411 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:26,578 INFO L418 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:26,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:26,579 INFO L82 PathProgramCache]: Analyzing trace with hash 434290920, now seen corresponding path program 8 times [2019-10-01 23:27:26,579 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:26,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:26,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:26,580 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:27:26,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:26,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:26,718 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 4 proven. 121 refuted. 0 times theorem prover too weak. 133 trivial. 0 not checked. [2019-10-01 23:27:26,718 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:26,718 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:26,744 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:27:26,780 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:27:26,780 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:26,781 INFO L256 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 13 conjunts are in the unsatisfiable core [2019-10-01 23:27:26,783 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2019-10-01 23:27:26,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:26,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 15 [2019-10-01 23:27:26,806 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-01 23:27:26,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-01 23:27:26,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:27:26,807 INFO L87 Difference]: Start difference. First operand 78 states and 80 transitions. Second operand 15 states. [2019-10-01 23:27:26,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:26,935 INFO L93 Difference]: Finished difference Result 133 states and 138 transitions. [2019-10-01 23:27:26,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-10-01 23:27:26,936 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 75 [2019-10-01 23:27:26,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:26,937 INFO L225 Difference]: With dead ends: 133 [2019-10-01 23:27:26,937 INFO L226 Difference]: Without dead ends: 84 [2019-10-01 23:27:26,938 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-10-01 23:27:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-10-01 23:27:26,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2019-10-01 23:27:26,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2019-10-01 23:27:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 84 transitions. [2019-10-01 23:27:26,947 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 84 transitions. Word has length 75 [2019-10-01 23:27:26,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:26,947 INFO L475 AbstractCegarLoop]: Abstraction has 82 states and 84 transitions. [2019-10-01 23:27:26,947 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-01 23:27:26,947 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 84 transitions. [2019-10-01 23:27:26,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-01 23:27:26,949 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:26,949 INFO L411 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:26,949 INFO L418 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:26,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:26,949 INFO L82 PathProgramCache]: Analyzing trace with hash -38085788, now seen corresponding path program 9 times [2019-10-01 23:27:26,950 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:26,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:26,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:26,951 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:26,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:27,109 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 4 proven. 144 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2019-10-01 23:27:27,110 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:27,110 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:27,132 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:27:27,189 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2019-10-01 23:27:27,190 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:27,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 39 conjunts are in the unsatisfiable core [2019-10-01 23:27:27,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:27,202 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:27:27,202 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:27,212 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:27:27,212 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:27:27,212 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-01 23:27:27,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-10-01 23:27:27,240 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:27,248 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:27:27,248 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:27:27,249 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-01 23:27:27,331 INFO L341 Elim1Store]: treesize reduction 58, result has 17.1 percent of original size [2019-10-01 23:27:27,332 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2019-10-01 23:27:27,333 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:27,343 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:27:27,343 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:27:27,344 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-10-01 23:27:27,423 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:27:27,425 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:27:27,426 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:27:27,427 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:27:27,428 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:27:27,429 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:27:27,432 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 7 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 78 [2019-10-01 23:27:27,433 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:27,457 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:27:27,458 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:27:27,458 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:80, output treesize:76 [2019-10-01 23:27:29,661 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_2| Int) (|v_main_~#b~0.base_BEFORE_CALL_2| Int) (v_main_~i~0_74 Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_2|)) (.cse3 (* (- 4) v_main_~i~0_74)) (.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_2|)) (.cse1 (* 4 v_main_~i~0_74))) (and (<= 99999 v_main_~i~0_74) (= (select .cse0 .cse1) (select .cse2 (+ .cse3 399996))) (not (= |v_main_~#b~0.base_BEFORE_CALL_2| |v_main_~#a~0.base_BEFORE_CALL_2|)) (= (select .cse2 (+ .cse3 400004)) (select .cse0 (+ .cse1 (- 8)))) (= (select .cse2 (+ .cse3 400000)) (select .cse0 (+ .cse1 (- 4)))) (< v_main_~i~0_74 100000)))) is different from true [2019-10-01 23:27:31,810 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_3| Int) (|v_main_~#b~0.base_BEFORE_CALL_3| Int) (v_main_~i~0_74 Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_3|)) (.cse1 (* (- 4) v_main_~i~0_74)) (.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_3|)) (.cse3 (* 4 v_main_~i~0_74))) (and (<= 99999 v_main_~i~0_74) (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (= (select .cse0 (+ .cse1 400004)) (select .cse2 (+ .cse3 (- 8)))) (not (= |v_main_~#b~0.base_BEFORE_CALL_3| |v_main_~#a~0.base_BEFORE_CALL_3|)) (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (< v_main_~i~0_74 100000)))) is different from true [2019-10-01 23:27:33,864 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 40 [2019-10-01 23:27:35,903 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 41 [2019-10-01 23:27:36,038 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 23:27:36,039 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:27:36,040 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:27:36,042 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:27:36,043 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 23:27:36,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:27:36,044 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:27:36,045 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:27:36,047 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 7 disjoint index pairs (out of 28 index pairs), introduced 6 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 16 [2019-10-01 23:27:36,047 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:27:36,054 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:27:36,055 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:27:36,055 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:80, output treesize:3 [2019-10-01 23:27:38,160 INFO L134 CoverageAnalysis]: Checked inductivity of 304 backedges. 61 proven. 11 refuted. 0 times theorem prover too weak. 225 trivial. 7 not checked. [2019-10-01 23:27:38,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:38,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 20] total 33 [2019-10-01 23:27:38,164 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 23:27:38,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 23:27:38,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=773, Unknown=3, NotChecked=118, Total=1056 [2019-10-01 23:27:38,166 INFO L87 Difference]: Start difference. First operand 82 states and 84 transitions. Second operand 33 states. [2019-10-01 23:27:46,766 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2019-10-01 23:27:50,840 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 63 DAG size of output: 42 [2019-10-01 23:27:57,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:57,581 INFO L93 Difference]: Finished difference Result 149 states and 155 transitions. [2019-10-01 23:27:57,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-10-01 23:27:57,582 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 79 [2019-10-01 23:27:57,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:57,584 INFO L225 Difference]: With dead ends: 149 [2019-10-01 23:27:57,584 INFO L226 Difference]: Without dead ends: 98 [2019-10-01 23:27:57,586 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 79 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 1761 ImplicationChecksByTransitivity, 27.4s TimeCoverageRelationStatistics Valid=1166, Invalid=5000, Unknown=4, NotChecked=310, Total=6480 [2019-10-01 23:27:57,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2019-10-01 23:27:57,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2019-10-01 23:27:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2019-10-01 23:27:57,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 96 transitions. [2019-10-01 23:27:57,597 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 96 transitions. Word has length 79 [2019-10-01 23:27:57,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:57,597 INFO L475 AbstractCegarLoop]: Abstraction has 94 states and 96 transitions. [2019-10-01 23:27:57,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 23:27:57,597 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 96 transitions. [2019-10-01 23:27:57,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-01 23:27:57,598 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:57,598 INFO L411 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:57,599 INFO L418 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:57,599 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:57,599 INFO L82 PathProgramCache]: Analyzing trace with hash 601037079, now seen corresponding path program 10 times [2019-10-01 23:27:57,599 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:57,599 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:57,600 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:57,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:57,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:57,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:57,752 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 6 proven. 169 refuted. 0 times theorem prover too weak. 199 trivial. 0 not checked. [2019-10-01 23:27:57,752 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:57,752 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:57,784 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:27:57,825 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:27:57,825 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:27:57,826 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 15 conjunts are in the unsatisfiable core [2019-10-01 23:27:57,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:27:57,857 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 205 trivial. 0 not checked. [2019-10-01 23:27:57,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:27:57,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 17 [2019-10-01 23:27:57,872 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-10-01 23:27:57,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-10-01 23:27:57,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:27:57,873 INFO L87 Difference]: Start difference. First operand 94 states and 96 transitions. Second operand 17 states. [2019-10-01 23:27:57,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:27:57,987 INFO L93 Difference]: Finished difference Result 161 states and 166 transitions. [2019-10-01 23:27:57,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-10-01 23:27:57,988 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 91 [2019-10-01 23:27:57,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:27:57,989 INFO L225 Difference]: With dead ends: 161 [2019-10-01 23:27:57,989 INFO L226 Difference]: Without dead ends: 100 [2019-10-01 23:27:57,990 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-10-01 23:27:57,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-10-01 23:27:58,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 98. [2019-10-01 23:27:58,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2019-10-01 23:27:58,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 100 transitions. [2019-10-01 23:27:58,007 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 100 transitions. Word has length 91 [2019-10-01 23:27:58,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:27:58,007 INFO L475 AbstractCegarLoop]: Abstraction has 98 states and 100 transitions. [2019-10-01 23:27:58,007 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-10-01 23:27:58,008 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 100 transitions. [2019-10-01 23:27:58,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-01 23:27:58,008 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:27:58,009 INFO L411 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:27:58,009 INFO L418 AbstractCegarLoop]: === Iteration 16 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:27:58,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:27:58,009 INFO L82 PathProgramCache]: Analyzing trace with hash 2027199379, now seen corresponding path program 11 times [2019-10-01 23:27:58,009 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:27:58,010 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:27:58,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:58,011 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:27:58,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:27:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:27:58,199 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 6 proven. 196 refuted. 0 times theorem prover too weak. 226 trivial. 0 not checked. [2019-10-01 23:27:58,200 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:27:58,200 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:27:58,225 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:28:12,315 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 15 check-sat command(s) [2019-10-01 23:28:12,315 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:28:12,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-01 23:28:12,332 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:28:12,374 INFO L134 CoverageAnalysis]: Checked inductivity of 428 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 232 trivial. 0 not checked. [2019-10-01 23:28:12,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:28:12,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 18 [2019-10-01 23:28:12,384 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-10-01 23:28:12,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-10-01 23:28:12,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:28:12,385 INFO L87 Difference]: Start difference. First operand 98 states and 100 transitions. Second operand 18 states. [2019-10-01 23:28:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:28:12,551 INFO L93 Difference]: Finished difference Result 167 states and 172 transitions. [2019-10-01 23:28:12,551 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-01 23:28:12,551 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 95 [2019-10-01 23:28:12,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:28:12,552 INFO L225 Difference]: With dead ends: 167 [2019-10-01 23:28:12,552 INFO L226 Difference]: Without dead ends: 104 [2019-10-01 23:28:12,553 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-10-01 23:28:12,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2019-10-01 23:28:12,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2019-10-01 23:28:12,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2019-10-01 23:28:12,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 104 transitions. [2019-10-01 23:28:12,567 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 104 transitions. Word has length 95 [2019-10-01 23:28:12,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:28:12,569 INFO L475 AbstractCegarLoop]: Abstraction has 102 states and 104 transitions. [2019-10-01 23:28:12,569 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-10-01 23:28:12,569 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 104 transitions. [2019-10-01 23:28:12,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-01 23:28:12,570 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:28:12,571 INFO L411 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:28:12,571 INFO L418 AbstractCegarLoop]: === Iteration 17 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:28:12,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:28:12,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2147127281, now seen corresponding path program 12 times [2019-10-01 23:28:12,571 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:28:12,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:28:12,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:12,573 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:28:12,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:12,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:12,804 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 6 proven. 225 refuted. 0 times theorem prover too weak. 255 trivial. 0 not checked. [2019-10-01 23:28:12,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:28:12,805 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:28:12,854 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:28:13,967 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2019-10-01 23:28:13,967 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:28:13,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 23:28:13,971 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:28:13,986 INFO L134 CoverageAnalysis]: Checked inductivity of 486 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2019-10-01 23:28:13,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:28:13,992 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 19 [2019-10-01 23:28:13,993 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-10-01 23:28:13,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-10-01 23:28:13,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:28:13,994 INFO L87 Difference]: Start difference. First operand 102 states and 104 transitions. Second operand 19 states. [2019-10-01 23:28:14,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:28:14,130 INFO L93 Difference]: Finished difference Result 173 states and 178 transitions. [2019-10-01 23:28:14,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-10-01 23:28:14,130 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 99 [2019-10-01 23:28:14,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:28:14,131 INFO L225 Difference]: With dead ends: 173 [2019-10-01 23:28:14,131 INFO L226 Difference]: Without dead ends: 108 [2019-10-01 23:28:14,132 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-10-01 23:28:14,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-10-01 23:28:14,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 106. [2019-10-01 23:28:14,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2019-10-01 23:28:14,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 108 transitions. [2019-10-01 23:28:14,141 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 108 transitions. Word has length 99 [2019-10-01 23:28:14,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:28:14,141 INFO L475 AbstractCegarLoop]: Abstraction has 106 states and 108 transitions. [2019-10-01 23:28:14,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-10-01 23:28:14,142 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 108 transitions. [2019-10-01 23:28:14,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2019-10-01 23:28:14,142 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:28:14,143 INFO L411 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:28:14,143 INFO L418 AbstractCegarLoop]: === Iteration 18 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:28:14,143 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:28:14,143 INFO L82 PathProgramCache]: Analyzing trace with hash -974088565, now seen corresponding path program 13 times [2019-10-01 23:28:14,143 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:28:14,144 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:28:14,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:14,145 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:28:14,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:14,392 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 6 proven. 256 refuted. 0 times theorem prover too weak. 286 trivial. 0 not checked. [2019-10-01 23:28:14,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:28:14,393 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:28:14,446 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:28:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:14,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 18 conjunts are in the unsatisfiable core [2019-10-01 23:28:14,503 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:28:14,534 INFO L134 CoverageAnalysis]: Checked inductivity of 548 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2019-10-01 23:28:14,547 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:28:14,547 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 20 [2019-10-01 23:28:14,548 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-10-01 23:28:14,548 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-10-01 23:28:14,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:28:14,549 INFO L87 Difference]: Start difference. First operand 106 states and 108 transitions. Second operand 20 states. [2019-10-01 23:28:14,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:28:14,684 INFO L93 Difference]: Finished difference Result 179 states and 184 transitions. [2019-10-01 23:28:14,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-10-01 23:28:14,685 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 103 [2019-10-01 23:28:14,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:28:14,687 INFO L225 Difference]: With dead ends: 179 [2019-10-01 23:28:14,687 INFO L226 Difference]: Without dead ends: 112 [2019-10-01 23:28:14,687 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-10-01 23:28:14,688 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2019-10-01 23:28:14,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 110. [2019-10-01 23:28:14,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2019-10-01 23:28:14,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 112 transitions. [2019-10-01 23:28:14,701 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 112 transitions. Word has length 103 [2019-10-01 23:28:14,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:28:14,701 INFO L475 AbstractCegarLoop]: Abstraction has 110 states and 112 transitions. [2019-10-01 23:28:14,701 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-10-01 23:28:14,701 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 112 transitions. [2019-10-01 23:28:14,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-01 23:28:14,703 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:28:14,703 INFO L411 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:28:14,703 INFO L418 AbstractCegarLoop]: === Iteration 19 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:28:14,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:28:14,704 INFO L82 PathProgramCache]: Analyzing trace with hash -2002710777, now seen corresponding path program 14 times [2019-10-01 23:28:14,704 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:28:14,704 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:28:14,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:14,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:28:14,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:14,956 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 6 proven. 289 refuted. 0 times theorem prover too weak. 319 trivial. 0 not checked. [2019-10-01 23:28:14,956 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:28:14,956 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:28:14,985 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:28:15,037 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:28:15,038 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:28:15,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 19 conjunts are in the unsatisfiable core [2019-10-01 23:28:15,041 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:28:15,063 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 325 trivial. 0 not checked. [2019-10-01 23:28:15,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:28:15,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 21 [2019-10-01 23:28:15,067 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-10-01 23:28:15,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-10-01 23:28:15,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:28:15,068 INFO L87 Difference]: Start difference. First operand 110 states and 112 transitions. Second operand 21 states. [2019-10-01 23:28:15,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:28:15,254 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2019-10-01 23:28:15,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-10-01 23:28:15,255 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 107 [2019-10-01 23:28:15,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:28:15,256 INFO L225 Difference]: With dead ends: 185 [2019-10-01 23:28:15,256 INFO L226 Difference]: Without dead ends: 116 [2019-10-01 23:28:15,257 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-10-01 23:28:15,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-10-01 23:28:15,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 114. [2019-10-01 23:28:15,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2019-10-01 23:28:15,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 116 transitions. [2019-10-01 23:28:15,269 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 116 transitions. Word has length 107 [2019-10-01 23:28:15,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:28:15,269 INFO L475 AbstractCegarLoop]: Abstraction has 114 states and 116 transitions. [2019-10-01 23:28:15,269 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-10-01 23:28:15,269 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 116 transitions. [2019-10-01 23:28:15,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-01 23:28:15,270 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:28:15,270 INFO L411 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:28:15,271 INFO L418 AbstractCegarLoop]: === Iteration 20 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:28:15,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:28:15,271 INFO L82 PathProgramCache]: Analyzing trace with hash 933353859, now seen corresponding path program 15 times [2019-10-01 23:28:15,271 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:28:15,271 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:28:15,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:15,273 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:28:15,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:15,517 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 6 proven. 324 refuted. 0 times theorem prover too weak. 354 trivial. 0 not checked. [2019-10-01 23:28:15,517 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:28:15,517 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:28:15,551 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:28:15,636 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2019-10-01 23:28:15,636 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:28:15,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 44 conjunts are in the unsatisfiable core [2019-10-01 23:28:15,642 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:28:15,653 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:28:15,654 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:28:15,659 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:28:15,659 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:28:15,659 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-01 23:28:15,690 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-10-01 23:28:15,691 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:28:15,704 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:28:15,705 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:28:15,705 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-01 23:28:15,774 INFO L341 Elim1Store]: treesize reduction 58, result has 17.1 percent of original size [2019-10-01 23:28:15,774 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2019-10-01 23:28:15,775 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:28:15,787 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:28:15,788 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:28:15,788 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-10-01 23:28:15,893 INFO L341 Elim1Store]: treesize reduction 150, result has 14.3 percent of original size [2019-10-01 23:28:15,894 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 78 [2019-10-01 23:28:15,894 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:28:15,907 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:28:15,907 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:28:15,908 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:73 [2019-10-01 23:28:15,993 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:15,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:15,995 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:15,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:15,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:15,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:15,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:15,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:16,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:16,003 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:16,004 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:16,005 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:16,008 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 13 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 105 [2019-10-01 23:28:16,008 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:28:16,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:28:16,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:28:16,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:101, output treesize:97 [2019-10-01 23:28:18,290 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_4| Int) (v_main_~i~0_153 Int) (|v_main_~#b~0.base_BEFORE_CALL_4| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_4|)) (.cse3 (* 4 v_main_~i~0_153)) (.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_4|)) (.cse1 (* (- 4) v_main_~i~0_153))) (and (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (not (= |v_main_~#b~0.base_BEFORE_CALL_4| |v_main_~#a~0.base_BEFORE_CALL_4|)) (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (< v_main_~i~0_153 100000) (= (select .cse0 (+ .cse1 400008)) (select .cse2 (+ .cse3 (- 12)))) (<= 99999 v_main_~i~0_153) (= (select .cse2 (+ .cse3 (- 8))) (select .cse0 (+ .cse1 400004)))))) is different from true [2019-10-01 23:28:20,445 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_5| Int) (v_main_~i~0_153 Int) (|v_main_~#b~0.base_BEFORE_CALL_5| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_5|)) (.cse1 (* (- 4) v_main_~i~0_153)) (.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_5|)) (.cse3 (* 4 v_main_~i~0_153))) (and (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (< v_main_~i~0_153 100000) (= (select .cse0 (+ .cse1 400008)) (select .cse2 (+ .cse3 (- 12)))) (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (<= 99999 v_main_~i~0_153) (not (= |v_main_~#b~0.base_BEFORE_CALL_5| |v_main_~#a~0.base_BEFORE_CALL_5|)) (= (select .cse0 (+ .cse1 400004)) (select .cse2 (+ .cse3 (- 8))))))) is different from true [2019-10-01 23:28:22,642 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_153 Int) (|v_main_~#a~0.base_BEFORE_CALL_6| Int) (|v_main_~#b~0.base_BEFORE_CALL_6| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_6|)) (.cse3 (* (- 4) v_main_~i~0_153)) (.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_6|)) (.cse1 (* 4 v_main_~i~0_153))) (and (= (select .cse0 .cse1) (select .cse2 (+ .cse3 399996))) (not (= |v_main_~#b~0.base_BEFORE_CALL_6| |v_main_~#a~0.base_BEFORE_CALL_6|)) (= (select .cse0 (+ .cse1 (- 4))) (select .cse2 (+ .cse3 400000))) (< v_main_~i~0_153 100000) (= (select .cse0 (+ .cse1 (- 8))) (select .cse2 (+ .cse3 400004))) (<= 99999 v_main_~i~0_153) (= (select .cse2 (+ .cse3 400008)) (select .cse0 (+ .cse1 (- 12))))))) is different from true [2019-10-01 23:28:24,711 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 47 [2019-10-01 23:28:26,756 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 48 [2019-10-01 23:28:26,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:26,911 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:26,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:26,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:26,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:26,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:26,917 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 23:28:26,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:26,919 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 23:28:26,920 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:26,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:26,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:26,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:26,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:26,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:28:26,928 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 13 disjoint index pairs (out of 45 index pairs), introduced 8 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 19 [2019-10-01 23:28:26,929 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:28:26,936 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:28:26,937 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:28:26,937 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:99, output treesize:3 [2019-10-01 23:28:29,102 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 125 proven. 22 refuted. 0 times theorem prover too weak. 520 trivial. 17 not checked. [2019-10-01 23:28:29,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:28:29,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 24] total 43 [2019-10-01 23:28:29,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-10-01 23:28:29,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-10-01 23:28:29,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=1281, Unknown=4, NotChecked=234, Total=1806 [2019-10-01 23:28:29,109 INFO L87 Difference]: Start difference. First operand 114 states and 116 transitions. Second operand 43 states. [2019-10-01 23:28:39,553 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 70 DAG size of output: 47 [2019-10-01 23:28:43,634 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 73 DAG size of output: 49 [2019-10-01 23:28:53,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:28:53,023 INFO L93 Difference]: Finished difference Result 201 states and 207 transitions. [2019-10-01 23:28:53,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2019-10-01 23:28:53,024 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 111 [2019-10-01 23:28:53,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:28:53,025 INFO L225 Difference]: With dead ends: 201 [2019-10-01 23:28:53,025 INFO L226 Difference]: Without dead ends: 130 [2019-10-01 23:28:53,028 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 87 SyntacticMatches, 6 SemanticMatches, 109 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3522 ImplicationChecksByTransitivity, 33.9s TimeCoverageRelationStatistics Valid=2259, Invalid=9304, Unknown=5, NotChecked=642, Total=12210 [2019-10-01 23:28:53,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2019-10-01 23:28:53,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2019-10-01 23:28:53,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2019-10-01 23:28:53,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2019-10-01 23:28:53,043 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 111 [2019-10-01 23:28:53,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:28:53,043 INFO L475 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2019-10-01 23:28:53,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-10-01 23:28:53,043 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2019-10-01 23:28:53,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-10-01 23:28:53,044 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:28:53,044 INFO L411 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:28:53,044 INFO L418 AbstractCegarLoop]: === Iteration 21 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:28:53,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:28:53,045 INFO L82 PathProgramCache]: Analyzing trace with hash -504481738, now seen corresponding path program 16 times [2019-10-01 23:28:53,045 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:28:53,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:28:53,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:53,046 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:28:53,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:53,325 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 8 proven. 361 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2019-10-01 23:28:53,325 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:28:53,325 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:28:53,359 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:28:53,413 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:28:53,413 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:28:53,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 21 conjunts are in the unsatisfiable core [2019-10-01 23:28:53,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:28:53,433 INFO L134 CoverageAnalysis]: Checked inductivity of 786 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2019-10-01 23:28:53,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:28:53,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 23 [2019-10-01 23:28:53,444 INFO L454 AbstractCegarLoop]: Interpolant automaton has 23 states [2019-10-01 23:28:53,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2019-10-01 23:28:53,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:28:53,445 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 23 states. [2019-10-01 23:28:53,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:28:53,626 INFO L93 Difference]: Finished difference Result 213 states and 218 transitions. [2019-10-01 23:28:53,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-10-01 23:28:53,627 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 123 [2019-10-01 23:28:53,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:28:53,633 INFO L225 Difference]: With dead ends: 213 [2019-10-01 23:28:53,633 INFO L226 Difference]: Without dead ends: 132 [2019-10-01 23:28:53,634 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2019-10-01 23:28:53,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-10-01 23:28:53,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2019-10-01 23:28:53,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2019-10-01 23:28:53,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 132 transitions. [2019-10-01 23:28:53,647 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 132 transitions. Word has length 123 [2019-10-01 23:28:53,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:28:53,648 INFO L475 AbstractCegarLoop]: Abstraction has 130 states and 132 transitions. [2019-10-01 23:28:53,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 23 states. [2019-10-01 23:28:53,648 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 132 transitions. [2019-10-01 23:28:53,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-01 23:28:53,649 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:28:53,649 INFO L411 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:28:53,649 INFO L418 AbstractCegarLoop]: === Iteration 22 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:28:53,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:28:53,649 INFO L82 PathProgramCache]: Analyzing trace with hash -720868686, now seen corresponding path program 17 times [2019-10-01 23:28:53,650 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:28:53,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:28:53,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:53,652 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:28:53,652 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:28:53,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:28:53,923 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 8 proven. 400 refuted. 0 times theorem prover too weak. 456 trivial. 0 not checked. [2019-10-01 23:28:53,923 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:28:53,923 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:28:53,976 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:30:05,204 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 21 check-sat command(s) [2019-10-01 23:30:05,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:30:05,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 22 conjunts are in the unsatisfiable core [2019-10-01 23:30:05,245 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:30:05,267 INFO L134 CoverageAnalysis]: Checked inductivity of 864 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2019-10-01 23:30:05,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:30:05,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 24 [2019-10-01 23:30:05,287 INFO L454 AbstractCegarLoop]: Interpolant automaton has 24 states [2019-10-01 23:30:05,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2019-10-01 23:30:05,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:30:05,288 INFO L87 Difference]: Start difference. First operand 130 states and 132 transitions. Second operand 24 states. [2019-10-01 23:30:05,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:30:05,471 INFO L93 Difference]: Finished difference Result 219 states and 224 transitions. [2019-10-01 23:30:05,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-10-01 23:30:05,472 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 127 [2019-10-01 23:30:05,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:30:05,473 INFO L225 Difference]: With dead ends: 219 [2019-10-01 23:30:05,473 INFO L226 Difference]: Without dead ends: 136 [2019-10-01 23:30:05,476 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2019-10-01 23:30:05,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2019-10-01 23:30:05,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2019-10-01 23:30:05,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2019-10-01 23:30:05,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 136 transitions. [2019-10-01 23:30:05,491 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 136 transitions. Word has length 127 [2019-10-01 23:30:05,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:30:05,491 INFO L475 AbstractCegarLoop]: Abstraction has 134 states and 136 transitions. [2019-10-01 23:30:05,491 INFO L476 AbstractCegarLoop]: Interpolant automaton has 24 states. [2019-10-01 23:30:05,491 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 136 transitions. [2019-10-01 23:30:05,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-10-01 23:30:05,492 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:30:05,492 INFO L411 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:30:05,493 INFO L418 AbstractCegarLoop]: === Iteration 23 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:30:05,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:30:05,493 INFO L82 PathProgramCache]: Analyzing trace with hash -1767772370, now seen corresponding path program 18 times [2019-10-01 23:30:05,493 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:30:05,493 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:30:05,494 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:05,494 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:30:05,495 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:30:05,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:30:05,814 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 8 proven. 441 refuted. 0 times theorem prover too weak. 497 trivial. 0 not checked. [2019-10-01 23:30:05,815 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:30:05,815 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:30:05,848 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:30:33,392 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 21 check-sat command(s) [2019-10-01 23:30:33,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:30:33,407 INFO L256 TraceCheckSpWp]: Trace formula consists of 331 conjuncts, 47 conjunts are in the unsatisfiable core [2019-10-01 23:30:33,409 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:30:33,414 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:30:33,415 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:30:33,424 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:30:33,425 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:30:33,425 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-01 23:30:33,457 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-10-01 23:30:33,458 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:30:33,465 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:30:33,466 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:30:33,466 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-01 23:30:33,554 INFO L341 Elim1Store]: treesize reduction 58, result has 17.1 percent of original size [2019-10-01 23:30:33,555 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2019-10-01 23:30:33,555 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:30:33,568 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:30:33,569 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:30:33,569 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-10-01 23:30:33,680 INFO L341 Elim1Store]: treesize reduction 150, result has 14.3 percent of original size [2019-10-01 23:30:33,681 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 78 [2019-10-01 23:30:33,681 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:30:33,696 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:30:33,696 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:30:33,697 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:73 [2019-10-01 23:30:33,844 INFO L341 Elim1Store]: treesize reduction 279, result has 11.7 percent of original size [2019-10-01 23:30:33,845 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 88 treesize of output 105 [2019-10-01 23:30:33,846 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:30:33,871 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:30:33,871 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:30:33,872 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:94 [2019-10-01 23:30:33,982 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:33,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:33,984 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:33,985 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:33,986 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:33,987 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:33,988 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:33,989 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:33,990 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:33,991 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:33,992 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:33,994 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:33,996 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:33,997 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:33,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:33,998 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:33,999 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:34,000 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:34,001 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:34,002 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:34,005 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 21 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 132 [2019-10-01 23:30:34,006 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:30:34,027 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:30:34,028 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:30:34,028 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:122, output treesize:118 [2019-10-01 23:30:36,349 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_197 Int) (|v_main_~#a~0.base_BEFORE_CALL_7| Int) (|v_main_~#b~0.base_BEFORE_CALL_7| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_7|)) (.cse3 (* (- 4) v_main_~i~0_197)) (.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_7|)) (.cse1 (* 4 v_main_~i~0_197))) (and (= (select .cse0 (+ .cse1 (- 12))) (select .cse2 (+ .cse3 400008))) (= (select .cse2 (+ .cse3 400012)) (select .cse0 (+ .cse1 (- 16)))) (= (select .cse2 (+ .cse3 399996)) (select .cse0 .cse1)) (not (= |v_main_~#b~0.base_BEFORE_CALL_7| |v_main_~#a~0.base_BEFORE_CALL_7|)) (= (select .cse0 (+ .cse1 (- 8))) (select .cse2 (+ .cse3 400004))) (< v_main_~i~0_197 100000) (= (select .cse2 (+ .cse3 400000)) (select .cse0 (+ .cse1 (- 4)))) (<= 99999 v_main_~i~0_197)))) is different from true [2019-10-01 23:30:38,607 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_197 Int) (|v_main_~#a~0.base_BEFORE_CALL_8| Int) (|v_main_~#b~0.base_BEFORE_CALL_8| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_8|)) (.cse1 (* 4 v_main_~i~0_197)) (.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_8|)) (.cse3 (* (- 4) v_main_~i~0_197))) (and (= (select .cse0 (+ .cse1 (- 16))) (select .cse2 (+ .cse3 400012))) (= (select .cse2 (+ .cse3 399996)) (select .cse0 .cse1)) (< v_main_~i~0_197 100000) (= (select .cse0 (+ .cse1 (- 8))) (select .cse2 (+ .cse3 400004))) (= (select .cse0 (+ .cse1 (- 12))) (select .cse2 (+ .cse3 400008))) (not (= |v_main_~#b~0.base_BEFORE_CALL_8| |v_main_~#a~0.base_BEFORE_CALL_8|)) (<= 99999 v_main_~i~0_197) (= (select .cse0 (+ .cse1 (- 4))) (select .cse2 (+ .cse3 400000)))))) is different from true [2019-10-01 23:30:40,787 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_197 Int) (|v_main_~#a~0.base_BEFORE_CALL_9| Int) (|v_main_~#b~0.base_BEFORE_CALL_9| Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_9|)) (.cse3 (* 4 v_main_~i~0_197)) (.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_9|)) (.cse1 (* (- 4) v_main_~i~0_197))) (and (not (= |v_main_~#b~0.base_BEFORE_CALL_9| |v_main_~#a~0.base_BEFORE_CALL_9|)) (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (= (select .cse2 (+ .cse3 (- 16))) (select .cse0 (+ .cse1 400012))) (< v_main_~i~0_197 100000) (= (select .cse0 (+ .cse1 400004)) (select .cse2 (+ .cse3 (- 8)))) (= (select .cse2 (+ .cse3 (- 12))) (select .cse0 (+ .cse1 400008))) (<= 99999 v_main_~i~0_197) (= (select .cse2 .cse3) (select .cse0 (+ .cse1 399996)))))) is different from true [2019-10-01 23:30:42,964 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_197 Int) (|v_main_~#a~0.base_BEFORE_CALL_10| Int) (|v_main_~#b~0.base_BEFORE_CALL_10| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_10|)) (.cse1 (* (- 4) v_main_~i~0_197)) (.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_10|)) (.cse3 (* 4 v_main_~i~0_197))) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_10| |v_main_~#b~0.base_BEFORE_CALL_10|)) (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (= (select .cse0 (+ .cse1 400008)) (select .cse2 (+ .cse3 (- 12)))) (= (select .cse2 (+ .cse3 (- 4))) (select .cse0 (+ .cse1 400000))) (< v_main_~i~0_197 100000) (= (select .cse0 (+ .cse1 400012)) (select .cse2 (+ .cse3 (- 16)))) (<= 99999 v_main_~i~0_197) (= (select .cse0 (+ .cse1 400004)) (select .cse2 (+ .cse3 (- 8))))))) is different from true [2019-10-01 23:30:45,081 WARN L191 SmtUtils]: Spent 2.02 s on a formula simplification that was a NOOP. DAG size: 54 [2019-10-01 23:30:47,142 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 55 [2019-10-01 23:30:47,343 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,344 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,345 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,346 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,347 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,349 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,350 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,351 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,352 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,353 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,354 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,355 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,357 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,358 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,359 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,360 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 23:30:47,361 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 23:30:47,362 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,363 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,365 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,366 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,367 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,368 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,369 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:30:47,371 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 21 disjoint index pairs (out of 66 index pairs), introduced 10 new quantified variables, introduced 0 case distinctions, treesize of input 108 treesize of output 22 [2019-10-01 23:30:47,372 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:30:47,380 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:30:47,381 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:30:47,381 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:118, output treesize:3 [2019-10-01 23:30:49,570 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 181 proven. 37 refuted. 0 times theorem prover too weak. 697 trivial. 31 not checked. [2019-10-01 23:30:49,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:30:49,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 28] total 50 [2019-10-01 23:30:49,583 INFO L454 AbstractCegarLoop]: Interpolant automaton has 50 states [2019-10-01 23:30:49,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2019-10-01 23:30:49,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=376, Invalid=1705, Unknown=5, NotChecked=364, Total=2450 [2019-10-01 23:30:49,585 INFO L87 Difference]: Start difference. First operand 134 states and 136 transitions. Second operand 50 states. [2019-10-01 23:30:52,218 WARN L191 SmtUtils]: Spent 882.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-01 23:30:52,786 WARN L191 SmtUtils]: Spent 247.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-01 23:30:53,120 WARN L191 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-01 23:30:53,441 WARN L191 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-01 23:30:53,824 WARN L191 SmtUtils]: Spent 221.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-01 23:30:54,259 WARN L191 SmtUtils]: Spent 271.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-01 23:30:54,580 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-01 23:30:55,143 WARN L191 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-01 23:30:55,465 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-01 23:30:55,806 WARN L191 SmtUtils]: Spent 150.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-01 23:30:56,225 WARN L191 SmtUtils]: Spent 209.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-01 23:30:56,611 WARN L191 SmtUtils]: Spent 176.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-01 23:30:57,172 WARN L191 SmtUtils]: Spent 348.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-10-01 23:31:04,012 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 80 DAG size of output: 54 [2019-10-01 23:31:08,099 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 83 DAG size of output: 56 [2019-10-01 23:31:20,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:31:20,007 INFO L93 Difference]: Finished difference Result 235 states and 241 transitions. [2019-10-01 23:31:20,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-10-01 23:31:20,008 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 131 [2019-10-01 23:31:20,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:31:20,009 INFO L225 Difference]: With dead ends: 235 [2019-10-01 23:31:20,010 INFO L226 Difference]: Without dead ends: 150 [2019-10-01 23:31:20,014 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 102 SyntacticMatches, 8 SemanticMatches, 127 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 4901 ImplicationChecksByTransitivity, 42.8s TimeCoverageRelationStatistics Valid=2972, Invalid=12538, Unknown=6, NotChecked=996, Total=16512 [2019-10-01 23:31:20,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2019-10-01 23:31:20,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2019-10-01 23:31:20,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2019-10-01 23:31:20,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 148 transitions. [2019-10-01 23:31:20,033 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 148 transitions. Word has length 131 [2019-10-01 23:31:20,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:31:20,033 INFO L475 AbstractCegarLoop]: Abstraction has 146 states and 148 transitions. [2019-10-01 23:31:20,033 INFO L476 AbstractCegarLoop]: Interpolant automaton has 50 states. [2019-10-01 23:31:20,033 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 148 transitions. [2019-10-01 23:31:20,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-01 23:31:20,034 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:31:20,035 INFO L411 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:31:20,035 INFO L418 AbstractCegarLoop]: === Iteration 24 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:31:20,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:31:20,035 INFO L82 PathProgramCache]: Analyzing trace with hash -1213387551, now seen corresponding path program 19 times [2019-10-01 23:31:20,035 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:31:20,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:31:20,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:20,037 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:31:20,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:20,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:31:20,447 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 10 proven. 484 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2019-10-01 23:31:20,448 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:31:20,448 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:31:20,522 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:31:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:31:20,610 INFO L256 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 24 conjunts are in the unsatisfiable core [2019-10-01 23:31:20,616 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:31:20,656 INFO L134 CoverageAnalysis]: Checked inductivity of 1068 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2019-10-01 23:31:20,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:31:20,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25] total 26 [2019-10-01 23:31:20,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 26 states [2019-10-01 23:31:20,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2019-10-01 23:31:20,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:31:20,672 INFO L87 Difference]: Start difference. First operand 146 states and 148 transitions. Second operand 26 states. [2019-10-01 23:31:20,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:31:20,940 INFO L93 Difference]: Finished difference Result 247 states and 252 transitions. [2019-10-01 23:31:20,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-10-01 23:31:20,941 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 143 [2019-10-01 23:31:20,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:31:20,944 INFO L225 Difference]: With dead ends: 247 [2019-10-01 23:31:20,944 INFO L226 Difference]: Without dead ends: 152 [2019-10-01 23:31:20,945 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2019-10-01 23:31:20,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2019-10-01 23:31:20,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2019-10-01 23:31:20,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2019-10-01 23:31:20,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 152 transitions. [2019-10-01 23:31:20,980 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 152 transitions. Word has length 143 [2019-10-01 23:31:20,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:31:20,981 INFO L475 AbstractCegarLoop]: Abstraction has 150 states and 152 transitions. [2019-10-01 23:31:20,981 INFO L476 AbstractCegarLoop]: Interpolant automaton has 26 states. [2019-10-01 23:31:20,981 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 152 transitions. [2019-10-01 23:31:20,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-01 23:31:20,983 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:31:20,983 INFO L411 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:31:20,984 INFO L418 AbstractCegarLoop]: === Iteration 25 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:31:20,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:31:20,984 INFO L82 PathProgramCache]: Analyzing trace with hash 1893996893, now seen corresponding path program 20 times [2019-10-01 23:31:20,984 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:31:20,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:31:20,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:20,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:31:20,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:21,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:31:21,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1158 backedges. 10 proven. 529 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2019-10-01 23:31:21,559 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:31:21,559 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:31:21,604 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:31:21,667 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:31:21,667 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:31:21,669 INFO L256 TraceCheckSpWp]: Trace formula consists of 378 conjuncts, 25 conjunts are in the unsatisfiable core [2019-10-01 23:31:21,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:31:21,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1158 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 629 trivial. 0 not checked. [2019-10-01 23:31:21,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:31:21,708 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 26] total 27 [2019-10-01 23:31:21,709 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-10-01 23:31:21,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-10-01 23:31:21,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:31:21,710 INFO L87 Difference]: Start difference. First operand 150 states and 152 transitions. Second operand 27 states. [2019-10-01 23:31:21,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:31:21,903 INFO L93 Difference]: Finished difference Result 253 states and 258 transitions. [2019-10-01 23:31:21,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-10-01 23:31:21,904 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 147 [2019-10-01 23:31:21,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:31:21,905 INFO L225 Difference]: With dead ends: 253 [2019-10-01 23:31:21,905 INFO L226 Difference]: Without dead ends: 156 [2019-10-01 23:31:21,906 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2019-10-01 23:31:21,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2019-10-01 23:31:21,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2019-10-01 23:31:21,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-10-01 23:31:21,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 156 transitions. [2019-10-01 23:31:21,925 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 156 transitions. Word has length 147 [2019-10-01 23:31:21,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:31:21,925 INFO L475 AbstractCegarLoop]: Abstraction has 154 states and 156 transitions. [2019-10-01 23:31:21,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-10-01 23:31:21,925 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 156 transitions. [2019-10-01 23:31:21,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-01 23:31:21,926 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:31:21,926 INFO L411 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:31:21,927 INFO L418 AbstractCegarLoop]: === Iteration 26 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:31:21,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:31:21,927 INFO L82 PathProgramCache]: Analyzing trace with hash -934717479, now seen corresponding path program 21 times [2019-10-01 23:31:21,927 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:31:21,927 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:31:21,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:21,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:31:21,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:31:21,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:31:22,502 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 10 proven. 576 refuted. 0 times theorem prover too weak. 666 trivial. 0 not checked. [2019-10-01 23:31:22,503 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:31:22,503 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:31:22,574 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:31:23,152 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 13 check-sat command(s) [2019-10-01 23:31:23,152 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:31:23,156 INFO L256 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 54 conjunts are in the unsatisfiable core [2019-10-01 23:31:23,159 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:31:23,167 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:31:23,167 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:31:23,175 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:31:23,175 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:31:23,176 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-01 23:31:23,216 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-10-01 23:31:23,216 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:31:23,229 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:31:23,230 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:31:23,230 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-01 23:31:23,312 INFO L341 Elim1Store]: treesize reduction 58, result has 17.1 percent of original size [2019-10-01 23:31:23,313 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2019-10-01 23:31:23,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:31:23,327 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:31:23,328 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:31:23,328 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-10-01 23:31:23,484 INFO L341 Elim1Store]: treesize reduction 150, result has 14.3 percent of original size [2019-10-01 23:31:23,485 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 78 [2019-10-01 23:31:23,488 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:31:23,515 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:31:23,515 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:31:23,516 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:73 [2019-10-01 23:31:23,735 INFO L341 Elim1Store]: treesize reduction 279, result has 11.7 percent of original size [2019-10-01 23:31:23,735 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 88 treesize of output 105 [2019-10-01 23:31:23,736 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:31:23,763 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:31:23,763 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:31:23,764 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:94 [2019-10-01 23:31:24,031 INFO L341 Elim1Store]: treesize reduction 444, result has 9.9 percent of original size [2019-10-01 23:31:24,031 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 109 treesize of output 132 [2019-10-01 23:31:24,032 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:31:24,057 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:31:24,058 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:31:24,058 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:119, output treesize:115 [2019-10-01 23:31:24,227 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,228 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,229 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,230 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,231 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,232 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,233 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,234 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,235 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,236 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,237 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,238 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,239 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,240 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,241 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,242 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,243 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,245 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,246 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,247 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,248 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,249 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,250 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,251 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,252 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,253 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,255 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,256 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,257 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,258 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:24,261 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 31 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 0 case distinctions, treesize of input 130 treesize of output 159 [2019-10-01 23:31:24,262 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:31:24,287 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:31:24,287 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:31:24,288 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:143, output treesize:139 [2019-10-01 23:31:26,653 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_11| Int) (|v_main_~#b~0.base_BEFORE_CALL_11| Int) (v_main_~i~0_248 Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_11|)) (.cse3 (* 4 v_main_~i~0_248)) (.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_11|)) (.cse1 (* (- 4) v_main_~i~0_248))) (and (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (= (select .cse2 (+ .cse3 (- 4))) (select .cse0 (+ .cse1 400000))) (= (select .cse2 (+ .cse3 (- 12))) (select .cse0 (+ .cse1 400008))) (< v_main_~i~0_248 100000) (<= 99999 v_main_~i~0_248) (= (select .cse2 (+ .cse3 (- 16))) (select .cse0 (+ .cse1 400012))) (= (select .cse0 (+ .cse1 400016)) (select .cse2 (+ .cse3 (- 20)))) (not (= |v_main_~#a~0.base_BEFORE_CALL_11| |v_main_~#b~0.base_BEFORE_CALL_11|)) (= (select .cse2 (+ .cse3 (- 8))) (select .cse0 (+ .cse1 400004)))))) is different from true [2019-10-01 23:31:28,894 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_12| Int) (|v_main_~#a~0.base_BEFORE_CALL_12| Int) (v_main_~i~0_248 Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_12|)) (.cse3 (* (- 4) v_main_~i~0_248)) (.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_12|)) (.cse1 (* 4 v_main_~i~0_248))) (and (= (select .cse0 (+ .cse1 (- 20))) (select .cse2 (+ .cse3 400016))) (< v_main_~i~0_248 100000) (<= 99999 v_main_~i~0_248) (= (select .cse2 (+ .cse3 400000)) (select .cse0 (+ .cse1 (- 4)))) (= (select .cse2 (+ .cse3 400004)) (select .cse0 (+ .cse1 (- 8)))) (not (= |v_main_~#a~0.base_BEFORE_CALL_12| |v_main_~#b~0.base_BEFORE_CALL_12|)) (= (select .cse2 (+ .cse3 400008)) (select .cse0 (+ .cse1 (- 12)))) (= (select .cse0 .cse1) (select .cse2 (+ .cse3 399996))) (= (select .cse2 (+ .cse3 400012)) (select .cse0 (+ .cse1 (- 16))))))) is different from true [2019-10-01 23:31:31,087 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_13| Int) (|v_main_~#a~0.base_BEFORE_CALL_13| Int) (v_main_~i~0_248 Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_13|)) (.cse1 (* 4 v_main_~i~0_248)) (.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_13|)) (.cse3 (* (- 4) v_main_~i~0_248))) (and (= (select .cse0 (+ .cse1 (- 20))) (select .cse2 (+ .cse3 400016))) (not (= |v_main_~#a~0.base_BEFORE_CALL_13| |v_main_~#b~0.base_BEFORE_CALL_13|)) (< v_main_~i~0_248 100000) (<= 99999 v_main_~i~0_248) (= (select .cse2 (+ .cse3 400000)) (select .cse0 (+ .cse1 (- 4)))) (= (select .cse0 (+ .cse1 (- 16))) (select .cse2 (+ .cse3 400012))) (= (select .cse2 (+ .cse3 400008)) (select .cse0 (+ .cse1 (- 12)))) (= (select .cse2 (+ .cse3 400004)) (select .cse0 (+ .cse1 (- 8)))) (= (select .cse0 .cse1) (select .cse2 (+ .cse3 399996)))))) is different from true [2019-10-01 23:31:33,290 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_14| Int) (|v_main_~#b~0.base_BEFORE_CALL_14| Int) (v_main_~i~0_248 Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_14|)) (.cse3 (* (- 4) v_main_~i~0_248)) (.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_14|)) (.cse1 (* 4 v_main_~i~0_248))) (and (= (select .cse0 (+ .cse1 (- 4))) (select .cse2 (+ .cse3 400000))) (= (select .cse0 (+ .cse1 (- 16))) (select .cse2 (+ .cse3 400012))) (= (select .cse0 (+ .cse1 (- 8))) (select .cse2 (+ .cse3 400004))) (< v_main_~i~0_248 100000) (<= 99999 v_main_~i~0_248) (= (select .cse0 (+ .cse1 (- 12))) (select .cse2 (+ .cse3 400008))) (= (select .cse0 (+ .cse1 (- 20))) (select .cse2 (+ .cse3 400016))) (= (select .cse2 (+ .cse3 399996)) (select .cse0 .cse1)) (not (= |v_main_~#a~0.base_BEFORE_CALL_14| |v_main_~#b~0.base_BEFORE_CALL_14|))))) is different from true [2019-10-01 23:31:35,509 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_15| Int) (|v_main_~#b~0.base_BEFORE_CALL_15| Int) (v_main_~i~0_248 Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_15|)) (.cse3 (* (- 4) v_main_~i~0_248)) (.cse0 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_15|)) (.cse1 (* 4 v_main_~i~0_248))) (and (= (select .cse0 (+ .cse1 (- 4))) (select .cse2 (+ .cse3 400000))) (< v_main_~i~0_248 100000) (= (select .cse2 (+ .cse3 399996)) (select .cse0 .cse1)) (<= 99999 v_main_~i~0_248) (not (= |v_main_~#a~0.base_BEFORE_CALL_15| |v_main_~#b~0.base_BEFORE_CALL_15|)) (= (select .cse0 (+ .cse1 (- 16))) (select .cse2 (+ .cse3 400012))) (= (select .cse2 (+ .cse3 400004)) (select .cse0 (+ .cse1 (- 8)))) (= (select .cse2 (+ .cse3 400008)) (select .cse0 (+ .cse1 (- 12)))) (= (select .cse2 (+ .cse3 400016)) (select .cse0 (+ .cse1 (- 20))))))) is different from true [2019-10-01 23:31:37,586 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 61 [2019-10-01 23:31:39,660 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 62 [2019-10-01 23:31:39,892 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,893 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,894 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,896 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,898 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,899 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,900 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,901 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,902 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,904 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,905 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,906 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 23:31:39,912 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,913 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,914 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,915 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,916 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,917 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,918 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,919 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,921 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,922 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,923 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,924 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,925 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,926 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,927 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,928 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,929 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,931 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,932 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,933 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,934 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 23:31:39,935 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:31:39,937 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 14 select indices, 14 select index equivalence classes, 31 disjoint index pairs (out of 91 index pairs), introduced 12 new quantified variables, introduced 0 case distinctions, treesize of input 127 treesize of output 25 [2019-10-01 23:31:39,937 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:31:39,942 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:31:39,943 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:31:39,943 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:137, output treesize:3 [2019-10-01 23:31:42,216 INFO L134 CoverageAnalysis]: Checked inductivity of 1252 backedges. 247 proven. 56 refuted. 0 times theorem prover too weak. 900 trivial. 49 not checked. [2019-10-01 23:31:42,221 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:31:42,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 32] total 57 [2019-10-01 23:31:42,222 INFO L454 AbstractCegarLoop]: Interpolant automaton has 57 states [2019-10-01 23:31:42,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2019-10-01 23:31:42,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=477, Invalid=2189, Unknown=6, NotChecked=520, Total=3192 [2019-10-01 23:31:42,223 INFO L87 Difference]: Start difference. First operand 154 states and 156 transitions. Second operand 57 states. [2019-10-01 23:31:55,725 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 90 DAG size of output: 61 [2019-10-01 23:31:59,847 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2019-10-01 23:32:15,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:32:15,289 INFO L93 Difference]: Finished difference Result 269 states and 275 transitions. [2019-10-01 23:32:15,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2019-10-01 23:32:15,290 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 151 [2019-10-01 23:32:15,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:32:15,291 INFO L225 Difference]: With dead ends: 269 [2019-10-01 23:32:15,291 INFO L226 Difference]: Without dead ends: 170 [2019-10-01 23:32:15,295 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 117 SyntacticMatches, 10 SemanticMatches, 145 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 6507 ImplicationChecksByTransitivity, 47.3s TimeCoverageRelationStatistics Valid=3782, Invalid=16253, Unknown=7, NotChecked=1420, Total=21462 [2019-10-01 23:32:15,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2019-10-01 23:32:15,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 166. [2019-10-01 23:32:15,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2019-10-01 23:32:15,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 168 transitions. [2019-10-01 23:32:15,314 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 168 transitions. Word has length 151 [2019-10-01 23:32:15,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:32:15,315 INFO L475 AbstractCegarLoop]: Abstraction has 166 states and 168 transitions. [2019-10-01 23:32:15,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 57 states. [2019-10-01 23:32:15,315 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 168 transitions. [2019-10-01 23:32:15,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-10-01 23:32:15,316 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:32:15,316 INFO L411 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:32:15,316 INFO L418 AbstractCegarLoop]: === Iteration 27 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:32:15,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:32:15,316 INFO L82 PathProgramCache]: Analyzing trace with hash -2034010996, now seen corresponding path program 22 times [2019-10-01 23:32:15,317 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:32:15,317 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:32:15,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:32:15,318 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:32:15,318 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:32:15,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:32:15,711 INFO L134 CoverageAnalysis]: Checked inductivity of 1394 backedges. 12 proven. 625 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2019-10-01 23:32:15,712 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:32:15,712 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:32:15,767 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:32:15,839 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:32:15,839 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:32:15,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 27 conjunts are in the unsatisfiable core [2019-10-01 23:32:15,844 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:32:15,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1394 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 769 trivial. 0 not checked. [2019-10-01 23:32:15,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:32:15,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 28] total 29 [2019-10-01 23:32:15,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 29 states [2019-10-01 23:32:15,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2019-10-01 23:32:15,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:32:15,881 INFO L87 Difference]: Start difference. First operand 166 states and 168 transitions. Second operand 29 states. [2019-10-01 23:32:16,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:32:16,123 INFO L93 Difference]: Finished difference Result 281 states and 286 transitions. [2019-10-01 23:32:16,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-10-01 23:32:16,124 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 163 [2019-10-01 23:32:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:32:16,125 INFO L225 Difference]: With dead ends: 281 [2019-10-01 23:32:16,125 INFO L226 Difference]: Without dead ends: 172 [2019-10-01 23:32:16,126 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2019-10-01 23:32:16,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2019-10-01 23:32:16,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2019-10-01 23:32:16,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2019-10-01 23:32:16,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 172 transitions. [2019-10-01 23:32:16,161 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 172 transitions. Word has length 163 [2019-10-01 23:32:16,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:32:16,161 INFO L475 AbstractCegarLoop]: Abstraction has 170 states and 172 transitions. [2019-10-01 23:32:16,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 29 states. [2019-10-01 23:32:16,161 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 172 transitions. [2019-10-01 23:32:16,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-01 23:32:16,164 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:32:16,164 INFO L411 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:32:16,165 INFO L418 AbstractCegarLoop]: === Iteration 28 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:32:16,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:32:16,165 INFO L82 PathProgramCache]: Analyzing trace with hash 21633800, now seen corresponding path program 23 times [2019-10-01 23:32:16,165 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:32:16,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:32:16,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:32:16,167 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:32:16,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:32:16,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:32:16,660 INFO L134 CoverageAnalysis]: Checked inductivity of 1496 backedges. 12 proven. 676 refuted. 0 times theorem prover too weak. 808 trivial. 0 not checked. [2019-10-01 23:32:16,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:32:16,661 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:32:16,751 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:34:45,313 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 27 check-sat command(s) [2019-10-01 23:34:45,313 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:34:45,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 425 conjuncts, 28 conjunts are in the unsatisfiable core [2019-10-01 23:34:45,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:34:45,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1496 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2019-10-01 23:34:45,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:34:45,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 30 [2019-10-01 23:34:45,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 30 states [2019-10-01 23:34:45,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2019-10-01 23:34:45,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:34:45,440 INFO L87 Difference]: Start difference. First operand 170 states and 172 transitions. Second operand 30 states. [2019-10-01 23:34:45,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:34:45,729 INFO L93 Difference]: Finished difference Result 287 states and 292 transitions. [2019-10-01 23:34:45,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-10-01 23:34:45,730 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 167 [2019-10-01 23:34:45,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:34:45,731 INFO L225 Difference]: With dead ends: 287 [2019-10-01 23:34:45,731 INFO L226 Difference]: Without dead ends: 176 [2019-10-01 23:34:45,732 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2019-10-01 23:34:45,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2019-10-01 23:34:45,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2019-10-01 23:34:45,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2019-10-01 23:34:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 176 transitions. [2019-10-01 23:34:45,775 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 176 transitions. Word has length 167 [2019-10-01 23:34:45,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:34:45,776 INFO L475 AbstractCegarLoop]: Abstraction has 174 states and 176 transitions. [2019-10-01 23:34:45,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 30 states. [2019-10-01 23:34:45,776 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 176 transitions. [2019-10-01 23:34:45,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2019-10-01 23:34:45,778 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:34:45,778 INFO L411 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:34:45,779 INFO L418 AbstractCegarLoop]: === Iteration 29 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:34:45,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:34:45,779 INFO L82 PathProgramCache]: Analyzing trace with hash -684846204, now seen corresponding path program 24 times [2019-10-01 23:34:45,779 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:34:45,779 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:34:45,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:34:45,796 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:34:45,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:34:45,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:34:46,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 12 proven. 729 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2019-10-01 23:34:46,453 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:34:46,453 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:34:46,519 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-10-01 23:35:07,055 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2019-10-01 23:35:07,056 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:35:07,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 435 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 23:35:07,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:35:07,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1602 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 873 trivial. 0 not checked. [2019-10-01 23:35:07,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:35:07,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 30] total 31 [2019-10-01 23:35:07,138 INFO L454 AbstractCegarLoop]: Interpolant automaton has 31 states [2019-10-01 23:35:07,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2019-10-01 23:35:07,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:35:07,139 INFO L87 Difference]: Start difference. First operand 174 states and 176 transitions. Second operand 31 states. [2019-10-01 23:35:07,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:35:07,401 INFO L93 Difference]: Finished difference Result 293 states and 298 transitions. [2019-10-01 23:35:07,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-10-01 23:35:07,416 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 171 [2019-10-01 23:35:07,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:35:07,417 INFO L225 Difference]: With dead ends: 293 [2019-10-01 23:35:07,417 INFO L226 Difference]: Without dead ends: 180 [2019-10-01 23:35:07,422 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2019-10-01 23:35:07,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-10-01 23:35:07,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 178. [2019-10-01 23:35:07,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2019-10-01 23:35:07,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 180 transitions. [2019-10-01 23:35:07,448 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 180 transitions. Word has length 171 [2019-10-01 23:35:07,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:35:07,448 INFO L475 AbstractCegarLoop]: Abstraction has 178 states and 180 transitions. [2019-10-01 23:35:07,448 INFO L476 AbstractCegarLoop]: Interpolant automaton has 31 states. [2019-10-01 23:35:07,448 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 180 transitions. [2019-10-01 23:35:07,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-10-01 23:35:07,449 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:35:07,449 INFO L411 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:35:07,450 INFO L418 AbstractCegarLoop]: === Iteration 30 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:35:07,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:35:07,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1241883136, now seen corresponding path program 25 times [2019-10-01 23:35:07,450 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:35:07,450 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:35:07,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:35:07,451 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:35:07,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:35:07,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:35:07,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1712 backedges. 12 proven. 784 refuted. 0 times theorem prover too weak. 916 trivial. 0 not checked. [2019-10-01 23:35:07,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:35:07,897 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:35:07,953 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:35:08,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:35:08,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 30 conjunts are in the unsatisfiable core [2019-10-01 23:35:08,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:35:08,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1712 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2019-10-01 23:35:08,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:35:08,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 31] total 32 [2019-10-01 23:35:08,059 INFO L454 AbstractCegarLoop]: Interpolant automaton has 32 states [2019-10-01 23:35:08,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2019-10-01 23:35:08,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:35:08,060 INFO L87 Difference]: Start difference. First operand 178 states and 180 transitions. Second operand 32 states. [2019-10-01 23:35:08,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:35:08,364 INFO L93 Difference]: Finished difference Result 299 states and 304 transitions. [2019-10-01 23:35:08,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-10-01 23:35:08,365 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 175 [2019-10-01 23:35:08,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:35:08,367 INFO L225 Difference]: With dead ends: 299 [2019-10-01 23:35:08,367 INFO L226 Difference]: Without dead ends: 184 [2019-10-01 23:35:08,368 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2019-10-01 23:35:08,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2019-10-01 23:35:08,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2019-10-01 23:35:08,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2019-10-01 23:35:08,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 184 transitions. [2019-10-01 23:35:08,400 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 184 transitions. Word has length 175 [2019-10-01 23:35:08,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:35:08,400 INFO L475 AbstractCegarLoop]: Abstraction has 182 states and 184 transitions. [2019-10-01 23:35:08,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 32 states. [2019-10-01 23:35:08,400 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 184 transitions. [2019-10-01 23:35:08,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-10-01 23:35:08,402 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:35:08,403 INFO L411 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:35:08,403 INFO L418 AbstractCegarLoop]: === Iteration 31 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:35:08,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:35:08,403 INFO L82 PathProgramCache]: Analyzing trace with hash 2092563068, now seen corresponding path program 26 times [2019-10-01 23:35:08,404 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:35:08,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:35:08,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:35:08,406 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-01 23:35:08,406 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:35:08,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:35:08,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 12 proven. 841 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2019-10-01 23:35:08,918 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:35:08,918 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:35:08,980 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-10-01 23:35:09,067 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-10-01 23:35:09,068 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:35:09,070 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 31 conjunts are in the unsatisfiable core [2019-10-01 23:35:09,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:35:09,102 INFO L134 CoverageAnalysis]: Checked inductivity of 1826 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2019-10-01 23:35:09,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:35:09,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 32] total 33 [2019-10-01 23:35:09,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 33 states [2019-10-01 23:35:09,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2019-10-01 23:35:09,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:35:09,107 INFO L87 Difference]: Start difference. First operand 182 states and 184 transitions. Second operand 33 states. [2019-10-01 23:35:09,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:35:09,377 INFO L93 Difference]: Finished difference Result 305 states and 310 transitions. [2019-10-01 23:35:09,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-10-01 23:35:09,377 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 179 [2019-10-01 23:35:09,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:35:09,379 INFO L225 Difference]: With dead ends: 305 [2019-10-01 23:35:09,379 INFO L226 Difference]: Without dead ends: 188 [2019-10-01 23:35:09,380 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2019-10-01 23:35:09,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-10-01 23:35:09,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2019-10-01 23:35:09,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2019-10-01 23:35:09,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 188 transitions. [2019-10-01 23:35:09,406 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 188 transitions. Word has length 179 [2019-10-01 23:35:09,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:35:09,407 INFO L475 AbstractCegarLoop]: Abstraction has 186 states and 188 transitions. [2019-10-01 23:35:09,407 INFO L476 AbstractCegarLoop]: Interpolant automaton has 33 states. [2019-10-01 23:35:09,407 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 188 transitions. [2019-10-01 23:35:09,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2019-10-01 23:35:09,408 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:35:09,409 INFO L411 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:35:09,409 INFO L418 AbstractCegarLoop]: === Iteration 32 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:35:09,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:35:09,409 INFO L82 PathProgramCache]: Analyzing trace with hash -1141380872, now seen corresponding path program 27 times [2019-10-01 23:35:09,410 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:35:09,410 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:35:09,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:35:09,412 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:35:09,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:35:09,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:35:10,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1944 backedges. 12 proven. 900 refuted. 0 times theorem prover too weak. 1032 trivial. 0 not checked. [2019-10-01 23:35:10,044 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:35:10,044 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:35:10,108 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-10-01 23:35:10,917 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2019-10-01 23:35:10,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:35:10,921 INFO L256 TraceCheckSpWp]: Trace formula consists of 305 conjuncts, 57 conjunts are in the unsatisfiable core [2019-10-01 23:35:10,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:35:10,934 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2019-10-01 23:35:10,935 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:35:10,938 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:35:10,939 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:35:10,939 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2019-10-01 23:35:10,967 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 24 [2019-10-01 23:35:10,967 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:35:10,977 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:35:10,977 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:35:10,978 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:35, output treesize:31 [2019-10-01 23:35:11,053 INFO L341 Elim1Store]: treesize reduction 58, result has 17.1 percent of original size [2019-10-01 23:35:11,053 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 51 [2019-10-01 23:35:11,054 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:35:11,065 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:35:11,066 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:35:11,066 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:56, output treesize:52 [2019-10-01 23:35:11,207 INFO L341 Elim1Store]: treesize reduction 150, result has 14.3 percent of original size [2019-10-01 23:35:11,208 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 67 treesize of output 78 [2019-10-01 23:35:11,209 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:35:11,223 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:35:11,223 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:35:11,223 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:77, output treesize:73 [2019-10-01 23:35:11,372 INFO L341 Elim1Store]: treesize reduction 279, result has 11.7 percent of original size [2019-10-01 23:35:11,372 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 12 case distinctions, treesize of input 88 treesize of output 105 [2019-10-01 23:35:11,374 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:35:11,396 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:35:11,397 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:35:11,397 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:98, output treesize:94 [2019-10-01 23:35:11,591 INFO L341 Elim1Store]: treesize reduction 444, result has 9.9 percent of original size [2019-10-01 23:35:11,591 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 1 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 20 case distinctions, treesize of input 109 treesize of output 132 [2019-10-01 23:35:11,592 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:35:11,612 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:35:11,613 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:35:11,613 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:119, output treesize:115 [2019-10-01 23:35:11,895 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 33 [2019-10-01 23:35:11,896 INFO L341 Elim1Store]: treesize reduction 645, result has 8.6 percent of original size [2019-10-01 23:35:11,896 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 11 select indices, 11 select index equivalence classes, 1 disjoint index pairs (out of 55 index pairs), introduced 11 new quantified variables, introduced 30 case distinctions, treesize of input 130 treesize of output 159 [2019-10-01 23:35:11,897 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:35:11,925 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:35:11,926 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:35:11,926 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:140, output treesize:136 [2019-10-01 23:35:12,125 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,126 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,127 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,130 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,131 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,132 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,133 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,134 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,135 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,136 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,137 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,139 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,140 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,141 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,142 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,143 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,144 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,145 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,146 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,147 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,148 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,149 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,150 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,151 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,152 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,153 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,154 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,155 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,156 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,157 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,158 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,159 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,161 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,162 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,164 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,165 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,167 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,168 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,169 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,170 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,171 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:12,173 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 13 select indices, 13 select index equivalence classes, 43 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 186 [2019-10-01 23:35:12,174 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:35:12,206 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:35:12,207 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:35:12,207 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:164, output treesize:160 [2019-10-01 23:35:14,694 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_16| Int) (|v_main_~#a~0.base_BEFORE_CALL_16| Int) (v_main_~i~0_390 Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_16|)) (.cse1 (* (- 4) v_main_~i~0_390)) (.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_16|)) (.cse3 (* 4 v_main_~i~0_390))) (and (<= 99999 v_main_~i~0_390) (not (= |v_main_~#a~0.base_BEFORE_CALL_16| |v_main_~#b~0.base_BEFORE_CALL_16|)) (= (select .cse0 (+ .cse1 400008)) (select .cse2 (+ .cse3 (- 12)))) (= (select .cse0 (+ .cse1 400020)) (select .cse2 (+ .cse3 (- 24)))) (= (select .cse0 (+ .cse1 400016)) (select .cse2 (+ .cse3 (- 20)))) (= (select .cse2 (+ .cse3 (- 8))) (select .cse0 (+ .cse1 400004))) (= (select .cse2 .cse3) (select .cse0 (+ .cse1 399996))) (= (select .cse0 (+ .cse1 400012)) (select .cse2 (+ .cse3 (- 16)))) (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (< v_main_~i~0_390 100000)))) is different from true [2019-10-01 23:35:16,939 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#b~0.base_BEFORE_CALL_17| Int) (|v_main_~#a~0.base_BEFORE_CALL_17| Int) (v_main_~i~0_390 Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_17|)) (.cse3 (* 4 v_main_~i~0_390)) (.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_17|)) (.cse1 (* (- 4) v_main_~i~0_390))) (and (<= 99999 v_main_~i~0_390) (= (select .cse0 (+ .cse1 400012)) (select .cse2 (+ .cse3 (- 16)))) (= (select .cse0 (+ .cse1 400020)) (select .cse2 (+ .cse3 (- 24)))) (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (not (= |v_main_~#a~0.base_BEFORE_CALL_17| |v_main_~#b~0.base_BEFORE_CALL_17|)) (= (select .cse0 (+ .cse1 400004)) (select .cse2 (+ .cse3 (- 8)))) (= (select .cse2 (+ .cse3 (- 20))) (select .cse0 (+ .cse1 400016))) (= (select .cse2 (+ .cse3 (- 12))) (select .cse0 (+ .cse1 400008))) (= (select .cse2 (+ .cse3 (- 4))) (select .cse0 (+ .cse1 400000))) (< v_main_~i~0_390 100000)))) is different from true [2019-10-01 23:35:19,195 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_18| Int) (|v_main_~#b~0.base_BEFORE_CALL_18| Int) (v_main_~i~0_390 Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_18|)) (.cse1 (* (- 4) v_main_~i~0_390)) (.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_18|)) (.cse3 (* 4 v_main_~i~0_390))) (and (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (= (select .cse0 (+ .cse1 400020)) (select .cse2 (+ .cse3 (- 24)))) (<= 99999 v_main_~i~0_390) (= (select .cse2 (+ .cse3 (- 8))) (select .cse0 (+ .cse1 400004))) (= (select .cse2 (+ .cse3 (- 16))) (select .cse0 (+ .cse1 400012))) (= (select .cse0 (+ .cse1 400016)) (select .cse2 (+ .cse3 (- 20)))) (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (not (= |v_main_~#a~0.base_BEFORE_CALL_18| |v_main_~#b~0.base_BEFORE_CALL_18|)) (= (select .cse0 (+ .cse1 400008)) (select .cse2 (+ .cse3 (- 12)))) (< v_main_~i~0_390 100000)))) is different from true [2019-10-01 23:35:21,454 WARN L860 $PredicateComparison]: unable to prove that (exists ((|v_main_~#a~0.base_BEFORE_CALL_19| Int) (|v_main_~#b~0.base_BEFORE_CALL_19| Int) (v_main_~i~0_390 Int)) (let ((.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_19|)) (.cse3 (* 4 v_main_~i~0_390)) (.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_19|)) (.cse1 (* (- 4) v_main_~i~0_390))) (and (not (= |v_main_~#a~0.base_BEFORE_CALL_19| |v_main_~#b~0.base_BEFORE_CALL_19|)) (<= 99999 v_main_~i~0_390) (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (= (select .cse2 (+ .cse3 (- 12))) (select .cse0 (+ .cse1 400008))) (= (select .cse2 (+ .cse3 (- 8))) (select .cse0 (+ .cse1 400004))) (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (= (select .cse2 (+ .cse3 (- 16))) (select .cse0 (+ .cse1 400012))) (= (select .cse0 (+ .cse1 400016)) (select .cse2 (+ .cse3 (- 20)))) (= (select .cse2 (+ .cse3 (- 24))) (select .cse0 (+ .cse1 400020))) (< v_main_~i~0_390 100000)))) is different from true [2019-10-01 23:35:23,733 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_390 Int) (|v_main_~#b~0.base_BEFORE_CALL_20| Int) (|v_main_~#a~0.base_BEFORE_CALL_20| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_20|)) (.cse1 (* (- 4) v_main_~i~0_390)) (.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_20|)) (.cse3 (* 4 v_main_~i~0_390))) (and (= (select .cse0 (+ .cse1 400016)) (select .cse2 (+ .cse3 (- 20)))) (= (select .cse2 .cse3) (select .cse0 (+ .cse1 399996))) (<= 99999 v_main_~i~0_390) (= (select .cse0 (+ .cse1 400020)) (select .cse2 (+ .cse3 (- 24)))) (not (= |v_main_~#a~0.base_BEFORE_CALL_20| |v_main_~#b~0.base_BEFORE_CALL_20|)) (= (select .cse2 (+ .cse3 (- 12))) (select .cse0 (+ .cse1 400008))) (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (= (select .cse0 (+ .cse1 400012)) (select .cse2 (+ .cse3 (- 16)))) (= (select .cse0 (+ .cse1 400004)) (select .cse2 (+ .cse3 (- 8)))) (< v_main_~i~0_390 100000)))) is different from true [2019-10-01 23:35:26,001 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~i~0_390 Int) (|v_main_~#a~0.base_BEFORE_CALL_21| Int) (|v_main_~#b~0.base_BEFORE_CALL_21| Int)) (let ((.cse0 (select |c_#memory_int| |v_main_~#a~0.base_BEFORE_CALL_21|)) (.cse1 (* (- 4) v_main_~i~0_390)) (.cse2 (select |c_#memory_int| |v_main_~#b~0.base_BEFORE_CALL_21|)) (.cse3 (* 4 v_main_~i~0_390))) (and (= (select .cse0 (+ .cse1 399996)) (select .cse2 .cse3)) (<= 99999 v_main_~i~0_390) (= (select .cse2 (+ .cse3 (- 16))) (select .cse0 (+ .cse1 400012))) (= (select .cse2 (+ .cse3 (- 8))) (select .cse0 (+ .cse1 400004))) (= (select .cse0 (+ .cse1 400000)) (select .cse2 (+ .cse3 (- 4)))) (= (select .cse2 (+ .cse3 (- 24))) (select .cse0 (+ .cse1 400020))) (= (select .cse2 (+ .cse3 (- 20))) (select .cse0 (+ .cse1 400016))) (not (= |v_main_~#a~0.base_BEFORE_CALL_21| |v_main_~#b~0.base_BEFORE_CALL_21|)) (= (select .cse0 (+ .cse1 400008)) (select .cse2 (+ .cse3 (- 12)))) (< v_main_~i~0_390 100000)))) is different from true [2019-10-01 23:35:28,087 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 68 [2019-10-01 23:35:30,183 WARN L191 SmtUtils]: Spent 2.01 s on a formula simplification that was a NOOP. DAG size: 69 [2019-10-01 23:35:30,469 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 23:35:30,470 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,471 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,472 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,473 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,474 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,475 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,477 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,478 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,479 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,480 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,481 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,482 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,484 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,485 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,486 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,487 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,488 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,489 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,490 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,491 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,492 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,494 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,495 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,496 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,497 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,498 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,501 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,502 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,503 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,505 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,506 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,508 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,509 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,510 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,512 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,513 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,514 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,515 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,516 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-01 23:35:30,517 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,518 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,519 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,520 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,521 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,522 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-10-01 23:35:30,524 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 16 select indices, 16 select index equivalence classes, 43 disjoint index pairs (out of 120 index pairs), introduced 14 new quantified variables, introduced 0 case distinctions, treesize of input 146 treesize of output 28 [2019-10-01 23:35:30,525 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-01 23:35:30,532 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-01 23:35:30,533 INFO L496 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-01 23:35:30,533 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:156, output treesize:3 [2019-10-01 23:35:32,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1944 backedges. 365 proven. 79 refuted. 0 times theorem prover too weak. 1429 trivial. 71 not checked. [2019-10-01 23:35:32,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:35:32,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 36] total 67 [2019-10-01 23:35:32,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-10-01 23:35:32,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-10-01 23:35:32,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=683, Invalid=2994, Unknown=7, NotChecked=738, Total=4422 [2019-10-01 23:35:32,925 INFO L87 Difference]: Start difference. First operand 186 states and 188 transitions. Second operand 67 states. [2019-10-01 23:35:49,871 WARN L191 SmtUtils]: Spent 4.02 s on a formula simplification. DAG size of input: 100 DAG size of output: 68 [2019-10-01 23:35:54,007 WARN L191 SmtUtils]: Spent 4.03 s on a formula simplification. DAG size of input: 103 DAG size of output: 70 [2019-10-01 23:36:12,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:36:12,775 INFO L93 Difference]: Finished difference Result 321 states and 327 transitions. [2019-10-01 23:36:12,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2019-10-01 23:36:12,776 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 183 [2019-10-01 23:36:12,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:36:12,777 INFO L225 Difference]: With dead ends: 321 [2019-10-01 23:36:12,777 INFO L226 Difference]: Without dead ends: 202 [2019-10-01 23:36:12,780 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 144 SyntacticMatches, 12 SemanticMatches, 175 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 9615 ImplicationChecksByTransitivity, 56.0s TimeCoverageRelationStatistics Valid=5616, Invalid=23470, Unknown=8, NotChecked=2058, Total=31152 [2019-10-01 23:36:12,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2019-10-01 23:36:12,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 198. [2019-10-01 23:36:12,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2019-10-01 23:36:12,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 200 transitions. [2019-10-01 23:36:12,815 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 200 transitions. Word has length 183 [2019-10-01 23:36:12,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:36:12,815 INFO L475 AbstractCegarLoop]: Abstraction has 198 states and 200 transitions. [2019-10-01 23:36:12,815 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-10-01 23:36:12,816 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 200 transitions. [2019-10-01 23:36:12,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-01 23:36:12,817 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:36:12,817 INFO L411 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:36:12,817 INFO L418 AbstractCegarLoop]: === Iteration 33 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:36:12,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:36:12,818 INFO L82 PathProgramCache]: Analyzing trace with hash 940779179, now seen corresponding path program 28 times [2019-10-01 23:36:12,818 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:36:12,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:36:12,819 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:36:12,820 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:36:12,820 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:36:12,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:36:13,504 INFO L134 CoverageAnalysis]: Checked inductivity of 2118 backedges. 14 proven. 961 refuted. 0 times theorem prover too weak. 1143 trivial. 0 not checked. [2019-10-01 23:36:13,504 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:36:13,504 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:36:13,571 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-10-01 23:36:13,656 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-10-01 23:36:13,656 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:36:13,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 33 conjunts are in the unsatisfiable core [2019-10-01 23:36:13,661 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:36:13,701 INFO L134 CoverageAnalysis]: Checked inductivity of 2118 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 1157 trivial. 0 not checked. [2019-10-01 23:36:13,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:36:13,716 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 34] total 35 [2019-10-01 23:36:13,717 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-10-01 23:36:13,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-10-01 23:36:13,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:36:13,718 INFO L87 Difference]: Start difference. First operand 198 states and 200 transitions. Second operand 35 states. [2019-10-01 23:36:14,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:36:14,015 INFO L93 Difference]: Finished difference Result 333 states and 338 transitions. [2019-10-01 23:36:14,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-10-01 23:36:14,016 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 195 [2019-10-01 23:36:14,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:36:14,017 INFO L225 Difference]: With dead ends: 333 [2019-10-01 23:36:14,017 INFO L226 Difference]: Without dead ends: 204 [2019-10-01 23:36:14,017 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2019-10-01 23:36:14,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2019-10-01 23:36:14,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 202. [2019-10-01 23:36:14,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 202 states. [2019-10-01 23:36:14,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 202 states to 202 states and 204 transitions. [2019-10-01 23:36:14,053 INFO L78 Accepts]: Start accepts. Automaton has 202 states and 204 transitions. Word has length 195 [2019-10-01 23:36:14,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:36:14,053 INFO L475 AbstractCegarLoop]: Abstraction has 202 states and 204 transitions. [2019-10-01 23:36:14,054 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-10-01 23:36:14,054 INFO L276 IsEmpty]: Start isEmpty. Operand 202 states and 204 transitions. [2019-10-01 23:36:14,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2019-10-01 23:36:14,055 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:36:14,055 INFO L411 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:36:14,055 INFO L418 AbstractCegarLoop]: === Iteration 34 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:36:14,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:36:14,056 INFO L82 PathProgramCache]: Analyzing trace with hash 761429287, now seen corresponding path program 29 times [2019-10-01 23:36:14,056 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:36:14,056 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:36:14,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:36:14,057 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:36:14,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:36:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:36:14,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 14 proven. 1024 refuted. 0 times theorem prover too weak. 1206 trivial. 0 not checked. [2019-10-01 23:36:14,592 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:36:14,592 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:36:14,659 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-10-01 23:39:57,733 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 33 check-sat command(s) [2019-10-01 23:39:57,734 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-10-01 23:39:57,814 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 34 conjunts are in the unsatisfiable core [2019-10-01 23:39:57,816 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-01 23:39:57,854 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 1220 trivial. 0 not checked. [2019-10-01 23:39:57,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-01 23:39:57,883 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35] total 36 [2019-10-01 23:39:57,883 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-10-01 23:39:57,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-10-01 23:39:57,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:39:57,884 INFO L87 Difference]: Start difference. First operand 202 states and 204 transitions. Second operand 36 states. [2019-10-01 23:39:58,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-01 23:39:58,174 INFO L93 Difference]: Finished difference Result 339 states and 344 transitions. [2019-10-01 23:39:58,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-10-01 23:39:58,174 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 199 [2019-10-01 23:39:58,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-01 23:39:58,175 INFO L225 Difference]: With dead ends: 339 [2019-10-01 23:39:58,175 INFO L226 Difference]: Without dead ends: 208 [2019-10-01 23:39:58,176 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2019-10-01 23:39:58,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2019-10-01 23:39:58,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2019-10-01 23:39:58,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2019-10-01 23:39:58,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 208 transitions. [2019-10-01 23:39:58,210 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 208 transitions. Word has length 199 [2019-10-01 23:39:58,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-01 23:39:58,211 INFO L475 AbstractCegarLoop]: Abstraction has 206 states and 208 transitions. [2019-10-01 23:39:58,211 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-10-01 23:39:58,211 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 208 transitions. [2019-10-01 23:39:58,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-01 23:39:58,212 INFO L403 BasicCegarLoop]: Found error trace [2019-10-01 23:39:58,212 INFO L411 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-01 23:39:58,213 INFO L418 AbstractCegarLoop]: === Iteration 35 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-01 23:39:58,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-01 23:39:58,213 INFO L82 PathProgramCache]: Analyzing trace with hash -765516381, now seen corresponding path program 30 times [2019-10-01 23:39:58,213 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-01 23:39:58,213 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-01 23:39:58,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:58,215 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-10-01 23:39:58,215 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-01 23:39:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-01 23:39:58,769 INFO L134 CoverageAnalysis]: Checked inductivity of 2374 backedges. 14 proven. 1089 refuted. 0 times theorem prover too weak. 1271 trivial. 0 not checked. [2019-10-01 23:39:58,769 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-01 23:39:58,769 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-01 23:39:58,835 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE