java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:36:24,713 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:36:24,715 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:36:24,731 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:36:24,731 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:36:24,732 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:36:24,733 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:36:24,735 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:36:24,737 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:36:24,738 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:36:24,739 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:36:24,739 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:36:24,740 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:36:24,742 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:36:24,743 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:36:24,745 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:36:24,747 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:36:24,749 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:36:24,751 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:36:24,752 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:36:24,755 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:36:24,755 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:36:24,755 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:36:24,756 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:36:24,757 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:36:24,759 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:36:24,759 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:36:24,760 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:36:24,760 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:36:24,760 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:36:24,761 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:36:24,761 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:36:24,772 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:36:24,773 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:36:24,773 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:36:24,774 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:36:24,774 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:36:24,774 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:36:24,774 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:36:24,775 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:36:24,775 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:36:24,775 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:36:24,776 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:36:24,776 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:36:24,776 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:36:24,776 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:36:24,776 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:36:24,777 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:36:24,777 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:36:24,777 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:36:24,777 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:36:24,778 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:36:24,778 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:36:24,778 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:36:24,778 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:36:24,779 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:36:24,779 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:36:24,779 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:36:24,779 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:36:24,779 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:36:24,780 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:36:24,780 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:36:24,780 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:36:24,780 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:36:24,781 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:36:24,781 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:36:24,817 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:36:24,827 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:36:24,830 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:36:24,831 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:36:24,831 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:36:24,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength2_true-valid-memsafety.c [2018-01-31 08:36:24,945 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:36:24,957 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:36:24,961 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:36:24,961 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:36:24,968 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:36:24,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:36:24" (1/1) ... [2018-01-31 08:36:24,975 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9fb236f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:24, skipping insertion in model container [2018-01-31 08:36:24,975 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:36:24" (1/1) ... [2018-01-31 08:36:24,994 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:36:25,014 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:36:25,166 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:36:25,192 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:36:25,202 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:25 WrapperNode [2018-01-31 08:36:25,202 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:36:25,203 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:36:25,203 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:36:25,204 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:36:25,219 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:25" (1/1) ... [2018-01-31 08:36:25,220 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:25" (1/1) ... [2018-01-31 08:36:25,231 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:25" (1/1) ... [2018-01-31 08:36:25,231 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:25" (1/1) ... [2018-01-31 08:36:25,238 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:25" (1/1) ... [2018-01-31 08:36:25,245 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:25" (1/1) ... [2018-01-31 08:36:25,247 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:25" (1/1) ... [2018-01-31 08:36:25,248 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:36:25,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:36:25,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:36:25,256 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:36:25,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:25" (1/1) ... No working directory specified, using /storage/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 [2018-01-31 08:36:25,329 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:36:25,329 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:36:25,329 INFO L136 BoogieDeclarations]: Found implementation of procedure bar [2018-01-31 08:36:25,329 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-31 08:36:25,330 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:36:25,330 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:36:25,330 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:36:25,330 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:36:25,330 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:36:25,330 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:36:25,331 INFO L128 BoogieDeclarations]: Found specification of procedure bar [2018-01-31 08:36:25,331 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-31 08:36:25,331 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:36:25,332 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:36:25,332 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:36:25,913 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:36:25,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:36:25 BoogieIcfgContainer [2018-01-31 08:36:25,914 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:36:25,915 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:36:25,915 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:36:25,921 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:36:25,921 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:36:24" (1/3) ... [2018-01-31 08:36:25,922 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eaf3d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:36:25, skipping insertion in model container [2018-01-31 08:36:25,922 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:36:25" (2/3) ... [2018-01-31 08:36:25,923 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eaf3d8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:36:25, skipping insertion in model container [2018-01-31 08:36:25,923 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:36:25" (3/3) ... [2018-01-31 08:36:25,925 INFO L107 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c [2018-01-31 08:36:25,935 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:36:25,944 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-01-31 08:36:25,993 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:36:25,993 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:36:25,993 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:36:25,993 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:36:25,994 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:36:25,994 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:36:25,994 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:36:25,994 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:36:25,995 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:36:26,018 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states. [2018-01-31 08:36:26,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-31 08:36:26,028 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:26,029 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:26,030 INFO L371 AbstractCegarLoop]: === Iteration 1 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:26,035 INFO L82 PathProgramCache]: Analyzing trace with hash 1517835154, now seen corresponding path program 1 times [2018-01-31 08:36:26,037 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:26,038 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:26,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:26,096 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:26,096 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:26,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:26,153 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:26,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:36:26,194 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:36:26,194 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:36:26,196 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-31 08:36:26,210 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-31 08:36:26,211 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-31 08:36:26,213 INFO L87 Difference]: Start difference. First operand 89 states. Second operand 2 states. [2018-01-31 08:36:26,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:26,252 INFO L93 Difference]: Finished difference Result 169 states and 189 transitions. [2018-01-31 08:36:26,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-31 08:36:26,254 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2018-01-31 08:36:26,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:26,264 INFO L225 Difference]: With dead ends: 169 [2018-01-31 08:36:26,264 INFO L226 Difference]: Without dead ends: 86 [2018-01-31 08:36:26,269 INFO L554 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 [2018-01-31 08:36:26,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-31 08:36:26,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-31 08:36:26,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-31 08:36:26,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 91 transitions. [2018-01-31 08:36:26,317 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 91 transitions. Word has length 14 [2018-01-31 08:36:26,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:26,317 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 91 transitions. [2018-01-31 08:36:26,317 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-31 08:36:26,318 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2018-01-31 08:36:26,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-31 08:36:26,318 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:26,319 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:26,319 INFO L371 AbstractCegarLoop]: === Iteration 2 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:26,320 INFO L82 PathProgramCache]: Analyzing trace with hash -693346302, now seen corresponding path program 1 times [2018-01-31 08:36:26,321 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:26,321 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:26,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:26,322 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:26,322 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:26,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:26,441 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:26,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:36:26,508 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:36:26,508 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:36:26,509 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:36:26,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:36:26,513 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:36:26,513 INFO L87 Difference]: Start difference. First operand 86 states and 91 transitions. Second operand 3 states. [2018-01-31 08:36:26,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:26,723 INFO L93 Difference]: Finished difference Result 110 states and 118 transitions. [2018-01-31 08:36:26,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:36:26,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-01-31 08:36:26,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:26,729 INFO L225 Difference]: With dead ends: 110 [2018-01-31 08:36:26,729 INFO L226 Difference]: Without dead ends: 93 [2018-01-31 08:36:26,730 INFO L554 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 [2018-01-31 08:36:26,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-01-31 08:36:26,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 85. [2018-01-31 08:36:26,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-01-31 08:36:26,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 89 transitions. [2018-01-31 08:36:26,752 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 89 transitions. Word has length 15 [2018-01-31 08:36:26,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:26,754 INFO L432 AbstractCegarLoop]: Abstraction has 85 states and 89 transitions. [2018-01-31 08:36:26,754 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:36:26,754 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 89 transitions. [2018-01-31 08:36:26,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-31 08:36:26,755 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:26,755 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:26,755 INFO L371 AbstractCegarLoop]: === Iteration 3 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:26,755 INFO L82 PathProgramCache]: Analyzing trace with hash 1457275385, now seen corresponding path program 1 times [2018-01-31 08:36:26,756 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:26,756 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:26,757 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:26,758 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:26,758 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:26,786 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:27,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:36:27,044 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:36:27,044 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:36:27,044 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:36:27,044 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:36:27,044 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:36:27,045 INFO L87 Difference]: Start difference. First operand 85 states and 89 transitions. Second operand 6 states. [2018-01-31 08:36:27,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:27,280 INFO L93 Difference]: Finished difference Result 188 states and 200 transitions. [2018-01-31 08:36:27,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:36:27,281 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-31 08:36:27,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:27,283 INFO L225 Difference]: With dead ends: 188 [2018-01-31 08:36:27,283 INFO L226 Difference]: Without dead ends: 114 [2018-01-31 08:36:27,284 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:36:27,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-01-31 08:36:27,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 107. [2018-01-31 08:36:27,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-01-31 08:36:27,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2018-01-31 08:36:27,296 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 21 [2018-01-31 08:36:27,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:27,296 INFO L432 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2018-01-31 08:36:27,296 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:36:27,297 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2018-01-31 08:36:27,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-31 08:36:27,298 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:27,298 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:27,298 INFO L371 AbstractCegarLoop]: === Iteration 4 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:27,298 INFO L82 PathProgramCache]: Analyzing trace with hash 80098363, now seen corresponding path program 1 times [2018-01-31 08:36:27,298 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:27,298 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:27,299 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:27,300 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:27,300 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:27,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:27,315 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:27,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:36:27,504 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:36:27,504 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-01-31 08:36:27,505 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:36:27,505 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:36:27,505 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:36:27,506 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand 8 states. [2018-01-31 08:36:27,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:27,782 INFO L93 Difference]: Finished difference Result 210 states and 222 transitions. [2018-01-31 08:36:27,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:36:27,783 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-01-31 08:36:27,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:27,785 INFO L225 Difference]: With dead ends: 210 [2018-01-31 08:36:27,785 INFO L226 Difference]: Without dead ends: 124 [2018-01-31 08:36:27,786 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:36:27,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-31 08:36:27,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 117. [2018-01-31 08:36:27,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-01-31 08:36:27,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 122 transitions. [2018-01-31 08:36:27,812 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 122 transitions. Word has length 29 [2018-01-31 08:36:27,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:27,812 INFO L432 AbstractCegarLoop]: Abstraction has 117 states and 122 transitions. [2018-01-31 08:36:27,812 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:36:27,813 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2018-01-31 08:36:27,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-31 08:36:27,814 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:27,814 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:27,814 INFO L371 AbstractCegarLoop]: === Iteration 5 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:27,814 INFO L82 PathProgramCache]: Analyzing trace with hash -666706721, now seen corresponding path program 1 times [2018-01-31 08:36:27,814 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:27,815 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:27,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:27,819 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:27,819 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:27,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:27,849 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:28,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:36:28,028 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:36:28,028 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:36:28,028 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:36:28,028 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:36:28,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:36:28,029 INFO L87 Difference]: Start difference. First operand 117 states and 122 transitions. Second operand 5 states. [2018-01-31 08:36:28,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:28,125 INFO L93 Difference]: Finished difference Result 204 states and 216 transitions. [2018-01-31 08:36:28,126 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:36:28,126 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-31 08:36:28,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:28,129 INFO L225 Difference]: With dead ends: 204 [2018-01-31 08:36:28,129 INFO L226 Difference]: Without dead ends: 124 [2018-01-31 08:36:28,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:36:28,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-01-31 08:36:28,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 120. [2018-01-31 08:36:28,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-01-31 08:36:28,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2018-01-31 08:36:28,145 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 41 [2018-01-31 08:36:28,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:28,146 INFO L432 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2018-01-31 08:36:28,146 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:36:28,148 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2018-01-31 08:36:28,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-31 08:36:28,149 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:28,150 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:28,150 INFO L371 AbstractCegarLoop]: === Iteration 6 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:28,150 INFO L82 PathProgramCache]: Analyzing trace with hash -699612892, now seen corresponding path program 1 times [2018-01-31 08:36:28,150 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:28,150 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:28,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:28,151 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:28,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:28,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:28,170 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:28,516 WARN L143 SmtUtils]: Spent 115ms on a formula simplification that was a NOOP. DAG size: 14 [2018-01-31 08:36:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:36:28,529 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:36:28,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:36:28,529 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:36:28,530 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:36:28,530 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:36:28,530 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand 5 states. [2018-01-31 08:36:29,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:29,049 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2018-01-31 08:36:29,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:36:29,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2018-01-31 08:36:29,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:29,052 INFO L225 Difference]: With dead ends: 120 [2018-01-31 08:36:29,052 INFO L226 Difference]: Without dead ends: 118 [2018-01-31 08:36:29,052 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:36:29,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-01-31 08:36:29,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2018-01-31 08:36:29,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-01-31 08:36:29,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 123 transitions. [2018-01-31 08:36:29,065 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 123 transitions. Word has length 41 [2018-01-31 08:36:29,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:29,065 INFO L432 AbstractCegarLoop]: Abstraction has 118 states and 123 transitions. [2018-01-31 08:36:29,066 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:36:29,066 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 123 transitions. [2018-01-31 08:36:29,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-01-31 08:36:29,067 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:29,067 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:29,067 INFO L371 AbstractCegarLoop]: === Iteration 7 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:29,068 INFO L82 PathProgramCache]: Analyzing trace with hash -699612891, now seen corresponding path program 1 times [2018-01-31 08:36:29,068 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:29,068 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:29,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:29,069 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:29,069 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:29,087 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:29,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:36:29,298 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:36:29,298 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-01-31 08:36:29,299 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-01-31 08:36:29,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-01-31 08:36:29,299 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-31 08:36:29,299 INFO L87 Difference]: Start difference. First operand 118 states and 123 transitions. Second operand 8 states. [2018-01-31 08:36:29,604 WARN L143 SmtUtils]: Spent 149ms on a formula simplification that was a NOOP. DAG size: 25 [2018-01-31 08:36:29,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:29,875 INFO L93 Difference]: Finished difference Result 139 states and 147 transitions. [2018-01-31 08:36:29,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:36:29,877 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 41 [2018-01-31 08:36:29,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:29,879 INFO L225 Difference]: With dead ends: 139 [2018-01-31 08:36:29,879 INFO L226 Difference]: Without dead ends: 137 [2018-01-31 08:36:29,880 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:36:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-01-31 08:36:29,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 132. [2018-01-31 08:36:29,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-01-31 08:36:29,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 139 transitions. [2018-01-31 08:36:29,905 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 139 transitions. Word has length 41 [2018-01-31 08:36:29,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:29,905 INFO L432 AbstractCegarLoop]: Abstraction has 132 states and 139 transitions. [2018-01-31 08:36:29,906 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-01-31 08:36:29,906 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 139 transitions. [2018-01-31 08:36:29,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-31 08:36:29,907 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:29,908 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:29,908 INFO L371 AbstractCegarLoop]: === Iteration 8 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:29,908 INFO L82 PathProgramCache]: Analyzing trace with hash 521847270, now seen corresponding path program 1 times [2018-01-31 08:36:29,908 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:29,908 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:29,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:29,909 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:29,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:29,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:29,934 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:30,291 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:36:30,291 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:36:30,291 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:36:30,298 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:30,355 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:36:30,393 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:36:30,395 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:36:30,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:36:30,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:36:30,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:36:30,414 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-31 08:36:30,492 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) is different from true [2018-01-31 08:36:30,513 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:36:30,514 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:36:30,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:36:30,517 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:36:30,520 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:36:30,520 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-31 08:36:30,581 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) (exists ((v_prenex_2 Int) (v_prenex_1 Int)) (= (* 4 v_prenex_1) (select |c_#length| v_prenex_2)))) is different from true [2018-01-31 08:36:30,610 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:36:30,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:36:30,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:36:30,614 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:36:30,656 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-01-31 08:36:30,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:36:30,691 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-31 08:36:30,691 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:34, output treesize:27 [2018-01-31 08:36:30,809 WARN L146 SmtUtils]: Spent 102ms on a formula simplification. DAG size of input: 25 DAG size of output 19 [2018-01-31 08:36:30,998 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:36:31,024 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-31 08:36:31,026 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-31 08:36:31,055 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:36:31,056 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:36:31,057 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:36:31,057 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:36:31,075 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-31 08:36:31,075 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:38, output treesize:52 [2018-01-31 08:36:31,182 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2018-01-31 08:36:31,206 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:36:31,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2018-01-31 08:36:31,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-01-31 08:36:31,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-01-31 08:36:31,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=309, Unknown=2, NotChecked=74, Total=462 [2018-01-31 08:36:31,208 INFO L87 Difference]: Start difference. First operand 132 states and 139 transitions. Second operand 22 states. [2018-01-31 08:36:33,916 WARN L146 SmtUtils]: Spent 164ms on a formula simplification. DAG size of input: 49 DAG size of output 42 [2018-01-31 08:36:34,787 WARN L146 SmtUtils]: Spent 100ms on a formula simplification. DAG size of input: 44 DAG size of output 35 [2018-01-31 08:36:35,976 WARN L143 SmtUtils]: Spent 241ms on a formula simplification that was a NOOP. DAG size: 34 [2018-01-31 08:36:37,241 WARN L143 SmtUtils]: Spent 238ms on a formula simplification that was a NOOP. DAG size: 33 [2018-01-31 08:36:37,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:37,846 INFO L93 Difference]: Finished difference Result 184 states and 201 transitions. [2018-01-31 08:36:37,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:36:37,846 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 57 [2018-01-31 08:36:37,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:37,848 INFO L225 Difference]: With dead ends: 184 [2018-01-31 08:36:37,848 INFO L226 Difference]: Without dead ends: 182 [2018-01-31 08:36:37,849 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 315 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=248, Invalid=999, Unknown=21, NotChecked=138, Total=1406 [2018-01-31 08:36:37,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-01-31 08:36:37,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 134. [2018-01-31 08:36:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-01-31 08:36:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 142 transitions. [2018-01-31 08:36:37,865 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 142 transitions. Word has length 57 [2018-01-31 08:36:37,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:37,866 INFO L432 AbstractCegarLoop]: Abstraction has 134 states and 142 transitions. [2018-01-31 08:36:37,866 INFO L433 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-01-31 08:36:37,866 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 142 transitions. [2018-01-31 08:36:37,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-01-31 08:36:37,868 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:37,868 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:37,868 INFO L371 AbstractCegarLoop]: === Iteration 9 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:37,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1227537339, now seen corresponding path program 1 times [2018-01-31 08:36:37,869 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:37,869 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:37,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:37,870 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:37,870 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:37,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:37,890 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:37,958 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:36:37,958 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:36:37,958 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:36:37,963 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:37,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:37,989 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:36:38,004 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:36:38,024 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:36:38,024 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-01-31 08:36:38,024 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:36:38,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:36:38,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:36:38,025 INFO L87 Difference]: Start difference. First operand 134 states and 142 transitions. Second operand 7 states. [2018-01-31 08:36:38,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:38,074 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2018-01-31 08:36:38,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-31 08:36:38,074 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2018-01-31 08:36:38,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:38,076 INFO L225 Difference]: With dead ends: 147 [2018-01-31 08:36:38,076 INFO L226 Difference]: Without dead ends: 135 [2018-01-31 08:36:38,077 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:36:38,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-01-31 08:36:38,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2018-01-31 08:36:38,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-01-31 08:36:38,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 134 transitions. [2018-01-31 08:36:38,091 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 134 transitions. Word has length 57 [2018-01-31 08:36:38,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:38,091 INFO L432 AbstractCegarLoop]: Abstraction has 128 states and 134 transitions. [2018-01-31 08:36:38,092 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:36:38,092 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 134 transitions. [2018-01-31 08:36:38,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-31 08:36:38,093 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:38,093 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:38,093 INFO L371 AbstractCegarLoop]: === Iteration 10 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:38,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1002603826, now seen corresponding path program 1 times [2018-01-31 08:36:38,094 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:38,094 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:38,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:38,095 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:38,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:38,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:38,107 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:38,169 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-31 08:36:38,169 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:36:38,169 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-31 08:36:38,169 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-31 08:36:38,169 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-31 08:36:38,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:36:38,170 INFO L87 Difference]: Start difference. First operand 128 states and 134 transitions. Second operand 3 states. [2018-01-31 08:36:38,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:38,318 INFO L93 Difference]: Finished difference Result 128 states and 134 transitions. [2018-01-31 08:36:38,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-31 08:36:38,319 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2018-01-31 08:36:38,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:38,320 INFO L225 Difference]: With dead ends: 128 [2018-01-31 08:36:38,320 INFO L226 Difference]: Without dead ends: 127 [2018-01-31 08:36:38,321 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-31 08:36:38,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-01-31 08:36:38,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-01-31 08:36:38,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-01-31 08:36:38,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 133 transitions. [2018-01-31 08:36:38,334 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 133 transitions. Word has length 58 [2018-01-31 08:36:38,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:38,335 INFO L432 AbstractCegarLoop]: Abstraction has 127 states and 133 transitions. [2018-01-31 08:36:38,335 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-31 08:36:38,335 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 133 transitions. [2018-01-31 08:36:38,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-01-31 08:36:38,336 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:38,336 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:38,336 INFO L371 AbstractCegarLoop]: === Iteration 11 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:38,336 INFO L82 PathProgramCache]: Analyzing trace with hash -1002603825, now seen corresponding path program 1 times [2018-01-31 08:36:38,336 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:38,337 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:38,337 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:38,337 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:38,338 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:38,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:38,356 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:38,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-31 08:36:38,698 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:36:38,698 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-01-31 08:36:38,699 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-01-31 08:36:38,699 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-01-31 08:36:38,699 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-01-31 08:36:38,699 INFO L87 Difference]: Start difference. First operand 127 states and 133 transitions. Second operand 10 states. [2018-01-31 08:36:39,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:39,014 INFO L93 Difference]: Finished difference Result 127 states and 133 transitions. [2018-01-31 08:36:39,014 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:36:39,014 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2018-01-31 08:36:39,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:39,016 INFO L225 Difference]: With dead ends: 127 [2018-01-31 08:36:39,016 INFO L226 Difference]: Without dead ends: 126 [2018-01-31 08:36:39,016 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:36:39,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-01-31 08:36:39,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2018-01-31 08:36:39,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-31 08:36:39,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 132 transitions. [2018-01-31 08:36:39,029 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 132 transitions. Word has length 58 [2018-01-31 08:36:39,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:39,029 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 132 transitions. [2018-01-31 08:36:39,029 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-01-31 08:36:39,029 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 132 transitions. [2018-01-31 08:36:39,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-31 08:36:39,031 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:39,031 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:39,031 INFO L371 AbstractCegarLoop]: === Iteration 12 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:39,031 INFO L82 PathProgramCache]: Analyzing trace with hash -445614296, now seen corresponding path program 1 times [2018-01-31 08:36:39,031 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:39,031 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:39,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:39,036 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:39,036 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:39,050 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:39,221 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 16 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:36:39,222 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:36:39,222 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:36:39,227 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:39,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:39,266 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:36:39,317 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:36:39,339 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:36:39,339 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 11 [2018-01-31 08:36:39,339 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:36:39,339 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:36:39,339 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:36:39,339 INFO L87 Difference]: Start difference. First operand 126 states and 132 transitions. Second operand 11 states. [2018-01-31 08:36:39,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:39,882 INFO L93 Difference]: Finished difference Result 209 states and 222 transitions. [2018-01-31 08:36:39,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-01-31 08:36:39,883 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2018-01-31 08:36:39,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:39,884 INFO L225 Difference]: With dead ends: 209 [2018-01-31 08:36:39,884 INFO L226 Difference]: Without dead ends: 130 [2018-01-31 08:36:39,885 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=186, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:36:39,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-01-31 08:36:39,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 126. [2018-01-31 08:36:39,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-01-31 08:36:39,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2018-01-31 08:36:39,897 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 65 [2018-01-31 08:36:39,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:39,897 INFO L432 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2018-01-31 08:36:39,897 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:36:39,898 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2018-01-31 08:36:39,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-01-31 08:36:39,900 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:39,900 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:39,900 INFO L371 AbstractCegarLoop]: === Iteration 13 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:39,900 INFO L82 PathProgramCache]: Analyzing trace with hash 165743771, now seen corresponding path program 1 times [2018-01-31 08:36:39,900 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:39,901 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:39,901 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:39,901 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:39,902 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:39,917 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:40,159 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:36:40,159 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:36:40,160 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:36:40,166 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:40,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:40,212 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:36:40,498 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:36:40,517 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:36:40,517 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2018-01-31 08:36:40,518 INFO L409 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-01-31 08:36:40,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-01-31 08:36:40,518 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2018-01-31 08:36:40,518 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand 15 states. [2018-01-31 08:36:40,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:40,897 INFO L93 Difference]: Finished difference Result 243 states and 258 transitions. [2018-01-31 08:36:40,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:36:40,898 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 65 [2018-01-31 08:36:40,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:40,898 INFO L225 Difference]: With dead ends: 243 [2018-01-31 08:36:40,899 INFO L226 Difference]: Without dead ends: 164 [2018-01-31 08:36:40,899 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2018-01-31 08:36:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-01-31 08:36:40,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 158. [2018-01-31 08:36:40,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-31 08:36:40,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions. [2018-01-31 08:36:40,916 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 65 [2018-01-31 08:36:40,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:40,917 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions. [2018-01-31 08:36:40,917 INFO L433 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-01-31 08:36:40,917 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions. [2018-01-31 08:36:40,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-31 08:36:40,918 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:40,919 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:40,919 INFO L371 AbstractCegarLoop]: === Iteration 14 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:40,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1185889501, now seen corresponding path program 1 times [2018-01-31 08:36:40,919 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:40,920 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:40,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:40,920 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:40,920 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:40,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:40,946 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:41,178 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-31 08:36:41,178 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:36:41,207 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:36:41,207 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:36:41,207 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:36:41,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:36:41,208 INFO L87 Difference]: Start difference. First operand 158 states and 166 transitions. Second operand 7 states. [2018-01-31 08:36:41,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:41,298 INFO L93 Difference]: Finished difference Result 166 states and 174 transitions. [2018-01-31 08:36:41,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:36:41,298 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 73 [2018-01-31 08:36:41,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:41,299 INFO L225 Difference]: With dead ends: 166 [2018-01-31 08:36:41,299 INFO L226 Difference]: Without dead ends: 165 [2018-01-31 08:36:41,299 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:36:41,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-01-31 08:36:41,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 159. [2018-01-31 08:36:41,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-01-31 08:36:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 168 transitions. [2018-01-31 08:36:41,315 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 168 transitions. Word has length 73 [2018-01-31 08:36:41,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:41,316 INFO L432 AbstractCegarLoop]: Abstraction has 159 states and 168 transitions. [2018-01-31 08:36:41,316 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:36:41,316 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 168 transitions. [2018-01-31 08:36:41,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-01-31 08:36:41,317 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:41,317 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:41,317 INFO L371 AbstractCegarLoop]: === Iteration 15 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:41,317 INFO L82 PathProgramCache]: Analyzing trace with hash 1185889500, now seen corresponding path program 1 times [2018-01-31 08:36:41,317 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:41,317 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:41,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:41,318 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:41,318 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:41,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:41,333 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:41,373 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-31 08:36:41,374 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:36:41,374 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:36:41,374 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-31 08:36:41,374 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-31 08:36:41,374 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:36:41,375 INFO L87 Difference]: Start difference. First operand 159 states and 168 transitions. Second operand 5 states. [2018-01-31 08:36:41,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:41,463 INFO L93 Difference]: Finished difference Result 159 states and 168 transitions. [2018-01-31 08:36:41,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:36:41,463 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 73 [2018-01-31 08:36:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:41,465 INFO L225 Difference]: With dead ends: 159 [2018-01-31 08:36:41,465 INFO L226 Difference]: Without dead ends: 158 [2018-01-31 08:36:41,465 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:36:41,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-01-31 08:36:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2018-01-31 08:36:41,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-01-31 08:36:41,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 166 transitions. [2018-01-31 08:36:41,487 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 166 transitions. Word has length 73 [2018-01-31 08:36:41,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:41,488 INFO L432 AbstractCegarLoop]: Abstraction has 158 states and 166 transitions. [2018-01-31 08:36:41,488 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-31 08:36:41,488 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 166 transitions. [2018-01-31 08:36:41,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-01-31 08:36:41,489 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:41,489 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:41,489 INFO L371 AbstractCegarLoop]: === Iteration 16 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:41,489 INFO L82 PathProgramCache]: Analyzing trace with hash -910864110, now seen corresponding path program 1 times [2018-01-31 08:36:41,489 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:41,489 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:41,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:41,490 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:41,490 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:41,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:41,509 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:41,708 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-01-31 08:36:41,708 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:36:41,708 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:36:41,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:41,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:41,744 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:36:41,868 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 23 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:36:41,887 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:36:41,887 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 18 [2018-01-31 08:36:41,888 INFO L409 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-01-31 08:36:41,888 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-01-31 08:36:41,888 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2018-01-31 08:36:41,888 INFO L87 Difference]: Start difference. First operand 158 states and 166 transitions. Second operand 18 states. [2018-01-31 08:36:42,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:42,419 INFO L93 Difference]: Finished difference Result 304 states and 325 transitions. [2018-01-31 08:36:42,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:36:42,420 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 81 [2018-01-31 08:36:42,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:42,421 INFO L225 Difference]: With dead ends: 304 [2018-01-31 08:36:42,421 INFO L226 Difference]: Without dead ends: 213 [2018-01-31 08:36:42,422 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=961, Unknown=0, NotChecked=0, Total=1122 [2018-01-31 08:36:42,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-01-31 08:36:42,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 187. [2018-01-31 08:36:42,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-31 08:36:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 197 transitions. [2018-01-31 08:36:42,443 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 197 transitions. Word has length 81 [2018-01-31 08:36:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:42,444 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 197 transitions. [2018-01-31 08:36:42,444 INFO L433 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-01-31 08:36:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 197 transitions. [2018-01-31 08:36:42,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-01-31 08:36:42,445 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:42,445 INFO L351 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:42,445 INFO L371 AbstractCegarLoop]: === Iteration 17 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:42,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1982601529, now seen corresponding path program 1 times [2018-01-31 08:36:42,446 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:42,446 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:42,446 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:42,446 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:42,447 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:42,464 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:42,823 WARN L146 SmtUtils]: Spent 189ms on a formula simplification. DAG size of input: 9 DAG size of output 6 [2018-01-31 08:36:43,047 WARN L146 SmtUtils]: Spent 150ms on a formula simplification. DAG size of input: 17 DAG size of output 14 [2018-01-31 08:36:43,077 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 27 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-31 08:36:43,077 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:36:43,077 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:36:43,082 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:43,126 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:36:43,276 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2018-01-31 08:36:43,295 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-01-31 08:36:43,296 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [10] total 16 [2018-01-31 08:36:43,296 INFO L409 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-01-31 08:36:43,296 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-01-31 08:36:43,296 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2018-01-31 08:36:43,296 INFO L87 Difference]: Start difference. First operand 187 states and 197 transitions. Second operand 16 states. [2018-01-31 08:36:43,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:43,768 INFO L93 Difference]: Finished difference Result 311 states and 328 transitions. [2018-01-31 08:36:43,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-01-31 08:36:43,768 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 85 [2018-01-31 08:36:43,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:43,770 INFO L225 Difference]: With dead ends: 311 [2018-01-31 08:36:43,770 INFO L226 Difference]: Without dead ends: 181 [2018-01-31 08:36:43,771 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=107, Invalid=595, Unknown=0, NotChecked=0, Total=702 [2018-01-31 08:36:43,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-01-31 08:36:43,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 177. [2018-01-31 08:36:43,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-01-31 08:36:43,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 184 transitions. [2018-01-31 08:36:43,797 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 184 transitions. Word has length 85 [2018-01-31 08:36:43,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:43,797 INFO L432 AbstractCegarLoop]: Abstraction has 177 states and 184 transitions. [2018-01-31 08:36:43,797 INFO L433 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-01-31 08:36:43,797 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 184 transitions. [2018-01-31 08:36:43,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-01-31 08:36:43,798 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:43,798 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:43,798 INFO L371 AbstractCegarLoop]: === Iteration 18 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:43,799 INFO L82 PathProgramCache]: Analyzing trace with hash 1400008503, now seen corresponding path program 1 times [2018-01-31 08:36:43,799 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:43,799 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:43,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:43,800 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:43,800 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:43,822 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:44,270 WARN L146 SmtUtils]: Spent 195ms on a formula simplification. DAG size of input: 12 DAG size of output 11 [2018-01-31 08:36:44,531 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-01-31 08:36:44,532 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:36:44,532 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:36:44,537 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:44,580 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:36:44,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 11 treesize of output 8 [2018-01-31 08:36:44,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:36:44,660 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:36:44,664 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:36:44,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:36:44,667 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:15, output treesize:11 [2018-01-31 08:36:44,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 28 [2018-01-31 08:36:44,899 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 16 [2018-01-31 08:36:44,900 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:36:44,907 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:36:44,908 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-31 08:36:44,908 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:15, output treesize:11 [2018-01-31 08:36:45,052 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~3.base| Int)) (and (= |c_foo_#t~ret5| (select (select |c_#memory_int| |foo_~#a~3.base|) 0)) (= |c_#memory_int| (store |c_old(#memory_int)| |foo_~#a~3.base| (store (select |c_old(#memory_int)| |foo_~#a~3.base|) 0 (select (select |c_old(#memory_int)| |c_foo_#in~b.base|) |c_foo_#in~b.offset|)))))) is different from true [2018-01-31 08:36:45,210 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 21 proven. 12 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2018-01-31 08:36:45,229 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:36:45,229 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22] total 37 [2018-01-31 08:36:45,230 INFO L409 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-01-31 08:36:45,230 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-01-31 08:36:45,231 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1128, Unknown=19, NotChecked=68, Total=1332 [2018-01-31 08:36:45,231 INFO L87 Difference]: Start difference. First operand 177 states and 184 transitions. Second operand 37 states. [2018-01-31 08:36:49,498 WARN L146 SmtUtils]: Spent 516ms on a formula simplification. DAG size of input: 27 DAG size of output 22 [2018-01-31 08:36:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:49,973 INFO L93 Difference]: Finished difference Result 329 states and 350 transitions. [2018-01-31 08:36:49,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-01-31 08:36:49,973 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 93 [2018-01-31 08:36:49,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:49,975 INFO L225 Difference]: With dead ends: 329 [2018-01-31 08:36:49,975 INFO L226 Difference]: Without dead ends: 223 [2018-01-31 08:36:49,977 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 75 SyntacticMatches, 1 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=482, Invalid=4159, Unknown=55, NotChecked=134, Total=4830 [2018-01-31 08:36:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-01-31 08:36:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 187. [2018-01-31 08:36:49,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-01-31 08:36:50,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 195 transitions. [2018-01-31 08:36:50,001 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 195 transitions. Word has length 93 [2018-01-31 08:36:50,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:50,001 INFO L432 AbstractCegarLoop]: Abstraction has 187 states and 195 transitions. [2018-01-31 08:36:50,001 INFO L433 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-01-31 08:36:50,001 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 195 transitions. [2018-01-31 08:36:50,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-01-31 08:36:50,002 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:50,003 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:50,003 INFO L371 AbstractCegarLoop]: === Iteration 19 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:50,003 INFO L82 PathProgramCache]: Analyzing trace with hash -793722862, now seen corresponding path program 1 times [2018-01-31 08:36:50,003 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:50,003 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:50,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:50,004 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:50,004 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:50,024 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:50,138 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-01-31 08:36:50,138 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:36:50,138 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:36:50,144 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:50,173 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:36:50,193 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-01-31 08:36:50,213 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:36:50,213 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2018-01-31 08:36:50,213 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-31 08:36:50,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-31 08:36:50,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:36:50,214 INFO L87 Difference]: Start difference. First operand 187 states and 195 transitions. Second operand 9 states. [2018-01-31 08:36:51,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:51,511 INFO L93 Difference]: Finished difference Result 200 states and 208 transitions. [2018-01-31 08:36:51,512 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-31 08:36:51,512 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 109 [2018-01-31 08:36:51,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:51,513 INFO L225 Difference]: With dead ends: 200 [2018-01-31 08:36:51,513 INFO L226 Difference]: Without dead ends: 188 [2018-01-31 08:36:51,514 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 108 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2018-01-31 08:36:51,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-01-31 08:36:51,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 181. [2018-01-31 08:36:51,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-01-31 08:36:51,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 187 transitions. [2018-01-31 08:36:51,536 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 187 transitions. Word has length 109 [2018-01-31 08:36:51,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:51,536 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 187 transitions. [2018-01-31 08:36:51,536 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-31 08:36:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 187 transitions. [2018-01-31 08:36:51,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-01-31 08:36:51,537 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:51,538 INFO L351 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:51,538 INFO L371 AbstractCegarLoop]: === Iteration 20 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:51,538 INFO L82 PathProgramCache]: Analyzing trace with hash 543476210, now seen corresponding path program 1 times [2018-01-31 08:36:51,538 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:51,538 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:51,539 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:51,540 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:51,540 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:51,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:51,932 WARN L146 SmtUtils]: Spent 148ms on a formula simplification. DAG size of input: 7 DAG size of output 6 [2018-01-31 08:36:52,092 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 27 proven. 30 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-01-31 08:36:52,092 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:36:52,092 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:36:52,106 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:52,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:52,141 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:36:52,277 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:36:52,279 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-01-31 08:36:52,279 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:36:52,289 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:36:52,290 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:36:52,290 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:36:52,290 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:36:52,297 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-31 08:36:52,297 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:28 [2018-01-31 08:36:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 36 proven. 13 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-01-31 08:36:52,463 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:36:52,463 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 24 [2018-01-31 08:36:52,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-01-31 08:36:52,463 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-01-31 08:36:52,464 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=525, Unknown=0, NotChecked=0, Total=600 [2018-01-31 08:36:52,464 INFO L87 Difference]: Start difference. First operand 181 states and 187 transitions. Second operand 25 states. [2018-01-31 08:36:53,814 WARN L146 SmtUtils]: Spent 171ms on a formula simplification. DAG size of input: 30 DAG size of output 21 [2018-01-31 08:36:53,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:53,985 INFO L93 Difference]: Finished difference Result 199 states and 206 transitions. [2018-01-31 08:36:53,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 08:36:53,985 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 117 [2018-01-31 08:36:53,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:53,987 INFO L225 Difference]: With dead ends: 199 [2018-01-31 08:36:53,987 INFO L226 Difference]: Without dead ends: 197 [2018-01-31 08:36:53,988 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 112 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 383 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=226, Invalid=1256, Unknown=0, NotChecked=0, Total=1482 [2018-01-31 08:36:53,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-01-31 08:36:54,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 181. [2018-01-31 08:36:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-01-31 08:36:54,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 187 transitions. [2018-01-31 08:36:54,004 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 187 transitions. Word has length 117 [2018-01-31 08:36:54,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:54,004 INFO L432 AbstractCegarLoop]: Abstraction has 181 states and 187 transitions. [2018-01-31 08:36:54,004 INFO L433 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-01-31 08:36:54,004 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 187 transitions. [2018-01-31 08:36:54,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-01-31 08:36:54,005 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:54,005 INFO L351 BasicCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:54,005 INFO L371 AbstractCegarLoop]: === Iteration 21 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:54,005 INFO L82 PathProgramCache]: Analyzing trace with hash 936921255, now seen corresponding path program 2 times [2018-01-31 08:36:54,005 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:54,005 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:54,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:54,006 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:36:54,006 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:54,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:54,026 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:54,400 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 48 proven. 24 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-01-31 08:36:54,401 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:36:54,401 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:36:54,406 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:36:54,425 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:36:54,458 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:36:54,471 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:36:54,476 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:36:54,761 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 57 proven. 15 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2018-01-31 08:36:54,780 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:36:54,796 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 21 [2018-01-31 08:36:54,797 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:36:54,797 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:36:54,797 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2018-01-31 08:36:54,797 INFO L87 Difference]: Start difference. First operand 181 states and 187 transitions. Second operand 21 states. [2018-01-31 08:36:55,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:55,119 INFO L93 Difference]: Finished difference Result 338 states and 356 transitions. [2018-01-31 08:36:55,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-01-31 08:36:55,120 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 125 [2018-01-31 08:36:55,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:55,121 INFO L225 Difference]: With dead ends: 338 [2018-01-31 08:36:55,121 INFO L226 Difference]: Without dead ends: 238 [2018-01-31 08:36:55,122 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=198, Invalid=992, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 08:36:55,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-01-31 08:36:55,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 220. [2018-01-31 08:36:55,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-01-31 08:36:55,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 230 transitions. [2018-01-31 08:36:55,149 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 230 transitions. Word has length 125 [2018-01-31 08:36:55,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:55,149 INFO L432 AbstractCegarLoop]: Abstraction has 220 states and 230 transitions. [2018-01-31 08:36:55,150 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:36:55,150 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 230 transitions. [2018-01-31 08:36:55,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-01-31 08:36:55,151 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:55,151 INFO L351 BasicCegarLoop]: trace histogram [6, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:55,151 INFO L371 AbstractCegarLoop]: === Iteration 22 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:55,152 INFO L82 PathProgramCache]: Analyzing trace with hash -1045760738, now seen corresponding path program 2 times [2018-01-31 08:36:55,152 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:55,152 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:55,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:55,153 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:36:55,153 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:55,175 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:55,523 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 77 proven. 14 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-01-31 08:36:55,524 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:36:55,524 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:36:55,529 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:36:55,545 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:36:55,563 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:36:55,566 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:36:55,569 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:36:55,629 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:36:55,629 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:36:55,633 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-01-31 08:36:55,633 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:14 [2018-01-31 08:36:55,919 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 75 proven. 1 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2018-01-31 08:36:55,938 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:36:55,938 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 25 [2018-01-31 08:36:55,939 INFO L409 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-01-31 08:36:55,939 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-01-31 08:36:55,939 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2018-01-31 08:36:55,939 INFO L87 Difference]: Start difference. First operand 220 states and 230 transitions. Second operand 26 states. [2018-01-31 08:36:57,203 WARN L146 SmtUtils]: Spent 362ms on a formula simplification. DAG size of input: 27 DAG size of output 25 [2018-01-31 08:36:57,711 WARN L146 SmtUtils]: Spent 483ms on a formula simplification. DAG size of input: 31 DAG size of output 29 [2018-01-31 08:36:57,872 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 34 DAG size of output 31 [2018-01-31 08:36:58,199 WARN L146 SmtUtils]: Spent 263ms on a formula simplification. DAG size of input: 37 DAG size of output 33 [2018-01-31 08:36:58,563 WARN L146 SmtUtils]: Spent 286ms on a formula simplification. DAG size of input: 36 DAG size of output 35 [2018-01-31 08:36:59,138 WARN L146 SmtUtils]: Spent 328ms on a formula simplification. DAG size of input: 36 DAG size of output 34 [2018-01-31 08:36:59,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:36:59,436 INFO L93 Difference]: Finished difference Result 248 states and 259 transitions. [2018-01-31 08:36:59,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-31 08:36:59,439 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 141 [2018-01-31 08:36:59,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:36:59,440 INFO L225 Difference]: With dead ends: 248 [2018-01-31 08:36:59,441 INFO L226 Difference]: Without dead ends: 247 [2018-01-31 08:36:59,442 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 132 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 462 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=346, Invalid=2410, Unknown=0, NotChecked=0, Total=2756 [2018-01-31 08:36:59,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-01-31 08:36:59,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 236. [2018-01-31 08:36:59,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-01-31 08:36:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 245 transitions. [2018-01-31 08:36:59,475 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 245 transitions. Word has length 141 [2018-01-31 08:36:59,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:36:59,475 INFO L432 AbstractCegarLoop]: Abstraction has 236 states and 245 transitions. [2018-01-31 08:36:59,475 INFO L433 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-01-31 08:36:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 245 transitions. [2018-01-31 08:36:59,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-01-31 08:36:59,477 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:36:59,477 INFO L351 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:36:59,477 INFO L371 AbstractCegarLoop]: === Iteration 23 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:36:59,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1565479950, now seen corresponding path program 2 times [2018-01-31 08:36:59,477 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:36:59,477 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:36:59,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:59,479 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:36:59,479 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:36:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:36:59,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:36:59,659 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 72 proven. 13 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2018-01-31 08:36:59,660 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:36:59,660 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:36:59,665 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:36:59,682 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:36:59,723 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:36:59,736 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:36:59,740 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:36:59,862 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 53 proven. 2 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2018-01-31 08:36:59,882 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:36:59,896 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12] total 19 [2018-01-31 08:36:59,897 INFO L409 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-01-31 08:36:59,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-01-31 08:36:59,897 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:36:59,897 INFO L87 Difference]: Start difference. First operand 236 states and 245 transitions. Second operand 19 states. [2018-01-31 08:37:00,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:37:00,289 INFO L93 Difference]: Finished difference Result 402 states and 422 transitions. [2018-01-31 08:37:00,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-01-31 08:37:00,289 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 145 [2018-01-31 08:37:00,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:37:00,290 INFO L225 Difference]: With dead ends: 402 [2018-01-31 08:37:00,290 INFO L226 Difference]: Without dead ends: 233 [2018-01-31 08:37:00,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=919, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:37:00,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-01-31 08:37:00,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 224. [2018-01-31 08:37:00,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-01-31 08:37:00,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 230 transitions. [2018-01-31 08:37:00,319 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 230 transitions. Word has length 145 [2018-01-31 08:37:00,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:37:00,320 INFO L432 AbstractCegarLoop]: Abstraction has 224 states and 230 transitions. [2018-01-31 08:37:00,321 INFO L433 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-01-31 08:37:00,321 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 230 transitions. [2018-01-31 08:37:00,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-01-31 08:37:00,322 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:37:00,322 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:37:00,322 INFO L371 AbstractCegarLoop]: === Iteration 24 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:37:00,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1506247432, now seen corresponding path program 3 times [2018-01-31 08:37:00,322 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:37:00,322 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:37:00,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:00,323 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:37:00,323 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:37:00,349 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:37:00,899 WARN L146 SmtUtils]: Spent 200ms on a formula simplification. DAG size of input: 12 DAG size of output 11 [2018-01-31 08:37:01,167 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 4 proven. 76 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2018-01-31 08:37:01,167 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:37:01,167 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:37:01,172 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:37:01,189 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:37:01,199 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:37:01,212 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:37:01,216 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:37:01,222 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:37:01,229 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:37:01,229 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:01,234 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:37:01,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:01,238 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:01,238 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-31 08:37:01,261 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) is different from true [2018-01-31 08:37:01,266 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:37:01,266 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:01,270 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:01,270 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:01,271 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:01,271 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-31 08:37:01,354 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_7 Int) (v_prenex_8 Int)) (= (* 4 v_prenex_7) (select |c_#length| v_prenex_8))) (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0)))) is different from true [2018-01-31 08:37:01,390 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:01,392 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-01-31 08:37:01,392 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:01,402 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:01,403 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:01,404 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:01,404 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:01,411 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:01,411 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:34, output treesize:27 [2018-01-31 08:37:01,510 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:01,511 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:01,547 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:37:01,548 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:01,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:01,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-31 08:37:01,602 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_10 Int) (v_prenex_9 Int)) (= (* 4 v_prenex_9) (select |c_#length| v_prenex_10))) (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0)))) is different from true [2018-01-31 08:37:01,672 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:01,713 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-31 08:37:01,714 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:01,746 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:01,747 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:01,748 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:01,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:01,777 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-01-31 08:37:01,777 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:45, output treesize:66 [2018-01-31 08:37:01,902 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:37:01,903 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:01,994 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:01,995 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:02,018 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:02,018 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-31 08:37:03,064 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:03,065 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:03,065 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:03,065 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:03,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-31 08:37:03,128 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:03,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-31 08:37:03,151 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:44, output treesize:64 [2018-01-31 08:37:03,292 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 56 proven. 12 refuted. 0 times theorem prover too weak. 56 trivial. 52 not checked. [2018-01-31 08:37:03,311 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:37:03,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 23] total 40 [2018-01-31 08:37:03,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-01-31 08:37:03,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-01-31 08:37:03,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=1255, Unknown=18, NotChecked=222, Total=1640 [2018-01-31 08:37:03,313 INFO L87 Difference]: Start difference. First operand 224 states and 230 transitions. Second operand 41 states. [2018-01-31 08:37:05,053 WARN L146 SmtUtils]: Spent 117ms on a formula simplification. DAG size of input: 56 DAG size of output 32 [2018-01-31 08:37:05,651 WARN L143 SmtUtils]: Spent 181ms on a formula simplification that was a NOOP. DAG size: 42 [2018-01-31 08:37:06,347 WARN L146 SmtUtils]: Spent 154ms on a formula simplification. DAG size of input: 32 DAG size of output 27 [2018-01-31 08:37:06,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:37:06,746 INFO L93 Difference]: Finished difference Result 304 states and 321 transitions. [2018-01-31 08:37:06,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-01-31 08:37:06,746 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 161 [2018-01-31 08:37:06,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:37:06,749 INFO L225 Difference]: With dead ends: 304 [2018-01-31 08:37:06,749 INFO L226 Difference]: Without dead ends: 303 [2018-01-31 08:37:06,751 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 135 SyntacticMatches, 16 SemanticMatches, 80 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 2144 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=688, Invalid=5465, Unknown=21, NotChecked=468, Total=6642 [2018-01-31 08:37:06,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-01-31 08:37:06,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 270. [2018-01-31 08:37:06,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-01-31 08:37:06,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 285 transitions. [2018-01-31 08:37:06,789 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 285 transitions. Word has length 161 [2018-01-31 08:37:06,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:37:06,789 INFO L432 AbstractCegarLoop]: Abstraction has 270 states and 285 transitions. [2018-01-31 08:37:06,789 INFO L433 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-01-31 08:37:06,789 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 285 transitions. [2018-01-31 08:37:06,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-01-31 08:37:06,791 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:37:06,791 INFO L351 BasicCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:37:06,791 INFO L371 AbstractCegarLoop]: === Iteration 25 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:37:06,791 INFO L82 PathProgramCache]: Analyzing trace with hash 1950511502, now seen corresponding path program 1 times [2018-01-31 08:37:06,791 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:37:06,791 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:37:06,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:06,792 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:37:06,792 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:06,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:37:06,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:37:07,150 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-01-31 08:37:07,150 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:37:07,150 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:37:07,156 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:37:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:37:07,199 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:37:07,221 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 33 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-01-31 08:37:07,241 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:37:07,241 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 11 [2018-01-31 08:37:07,241 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:37:07,242 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:37:07,242 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:37:07,242 INFO L87 Difference]: Start difference. First operand 270 states and 285 transitions. Second operand 11 states. [2018-01-31 08:37:07,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:37:07,369 INFO L93 Difference]: Finished difference Result 311 states and 335 transitions. [2018-01-31 08:37:07,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:37:07,369 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 177 [2018-01-31 08:37:07,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:37:07,371 INFO L225 Difference]: With dead ends: 311 [2018-01-31 08:37:07,371 INFO L226 Difference]: Without dead ends: 299 [2018-01-31 08:37:07,371 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 176 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=180, Unknown=0, NotChecked=0, Total=272 [2018-01-31 08:37:07,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-01-31 08:37:07,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 284. [2018-01-31 08:37:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-01-31 08:37:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 299 transitions. [2018-01-31 08:37:07,400 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 299 transitions. Word has length 177 [2018-01-31 08:37:07,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:37:07,401 INFO L432 AbstractCegarLoop]: Abstraction has 284 states and 299 transitions. [2018-01-31 08:37:07,401 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:37:07,401 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 299 transitions. [2018-01-31 08:37:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-01-31 08:37:07,402 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:37:07,403 INFO L351 BasicCegarLoop]: trace histogram [9, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:37:07,403 INFO L371 AbstractCegarLoop]: === Iteration 26 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:37:07,403 INFO L82 PathProgramCache]: Analyzing trace with hash 506429987, now seen corresponding path program 1 times [2018-01-31 08:37:07,403 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:37:07,403 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:37:07,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:07,404 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:37:07,404 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:37:07,432 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:37:07,873 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 103 proven. 69 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2018-01-31 08:37:07,873 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:37:07,873 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:37:07,878 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:37:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:37:07,929 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:37:08,157 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:08,158 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 22 [2018-01-31 08:37:08,159 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:08,209 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:08,230 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:08,231 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:08,231 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:08,237 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 2 dim-1 vars, End of recursive call: 3 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:08,237 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:35, output treesize:28 [2018-01-31 08:37:08,656 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 112 proven. 31 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2018-01-31 08:37:08,676 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:37:08,676 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16] total 32 [2018-01-31 08:37:08,677 INFO L409 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-01-31 08:37:08,677 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-01-31 08:37:08,677 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=960, Unknown=0, NotChecked=0, Total=1056 [2018-01-31 08:37:08,677 INFO L87 Difference]: Start difference. First operand 284 states and 299 transitions. Second operand 33 states. [2018-01-31 08:37:09,419 WARN L146 SmtUtils]: Spent 468ms on a formula simplification. DAG size of input: 53 DAG size of output 42 [2018-01-31 08:37:12,296 WARN L146 SmtUtils]: Spent 342ms on a formula simplification. DAG size of input: 33 DAG size of output 32 [2018-01-31 08:37:12,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:37:12,377 INFO L93 Difference]: Finished difference Result 323 states and 347 transitions. [2018-01-31 08:37:12,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-01-31 08:37:12,377 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 193 [2018-01-31 08:37:12,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:37:12,379 INFO L225 Difference]: With dead ends: 323 [2018-01-31 08:37:12,379 INFO L226 Difference]: Without dead ends: 322 [2018-01-31 08:37:12,383 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 179 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1795 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=791, Invalid=5371, Unknown=0, NotChecked=0, Total=6162 [2018-01-31 08:37:12,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-01-31 08:37:12,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 282. [2018-01-31 08:37:12,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-01-31 08:37:12,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 297 transitions. [2018-01-31 08:37:12,421 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 297 transitions. Word has length 193 [2018-01-31 08:37:12,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:37:12,422 INFO L432 AbstractCegarLoop]: Abstraction has 282 states and 297 transitions. [2018-01-31 08:37:12,422 INFO L433 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-01-31 08:37:12,422 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 297 transitions. [2018-01-31 08:37:12,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-01-31 08:37:12,424 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:37:12,425 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:37:12,425 INFO L371 AbstractCegarLoop]: === Iteration 27 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:37:12,425 INFO L82 PathProgramCache]: Analyzing trace with hash 717927593, now seen corresponding path program 4 times [2018-01-31 08:37:12,426 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:37:12,426 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:37:12,426 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:12,426 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:37:12,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:12,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:37:12,453 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:37:13,510 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 123 proven. 31 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2018-01-31 08:37:13,510 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:37:13,510 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:37:13,515 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:37:13,592 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:37:13,600 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:37:13,958 INFO L134 CoverageAnalysis]: Checked inductivity of 476 backedges. 360 proven. 33 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2018-01-31 08:37:13,977 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:37:13,977 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2018-01-31 08:37:13,978 INFO L409 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-01-31 08:37:13,978 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-01-31 08:37:13,978 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=785, Unknown=0, NotChecked=0, Total=870 [2018-01-31 08:37:13,978 INFO L87 Difference]: Start difference. First operand 282 states and 297 transitions. Second operand 30 states. [2018-01-31 08:37:15,008 WARN L143 SmtUtils]: Spent 112ms on a formula simplification that was a NOOP. DAG size: 11 [2018-01-31 08:37:15,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:37:15,376 INFO L93 Difference]: Finished difference Result 456 states and 489 transitions. [2018-01-31 08:37:15,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-01-31 08:37:15,377 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 237 [2018-01-31 08:37:15,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:37:15,379 INFO L225 Difference]: With dead ends: 456 [2018-01-31 08:37:15,379 INFO L226 Difference]: Without dead ends: 305 [2018-01-31 08:37:15,381 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 288 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1063 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=430, Invalid=3860, Unknown=0, NotChecked=0, Total=4290 [2018-01-31 08:37:15,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-01-31 08:37:15,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 300. [2018-01-31 08:37:15,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-01-31 08:37:15,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 313 transitions. [2018-01-31 08:37:15,423 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 313 transitions. Word has length 237 [2018-01-31 08:37:15,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:37:15,424 INFO L432 AbstractCegarLoop]: Abstraction has 300 states and 313 transitions. [2018-01-31 08:37:15,424 INFO L433 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-01-31 08:37:15,424 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 313 transitions. [2018-01-31 08:37:15,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-01-31 08:37:15,426 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:37:15,426 INFO L351 BasicCegarLoop]: trace histogram [10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:37:15,426 INFO L371 AbstractCegarLoop]: === Iteration 28 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:37:15,427 INFO L82 PathProgramCache]: Analyzing trace with hash -655571618, now seen corresponding path program 5 times [2018-01-31 08:37:15,427 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:37:15,427 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:37:15,427 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:15,428 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:37:15,428 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:15,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:37:15,467 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:37:16,483 WARN L143 SmtUtils]: Spent 130ms on a formula simplification that was a NOOP. DAG size: 11 [2018-01-31 08:37:16,969 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 14 proven. 246 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2018-01-31 08:37:16,969 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:37:16,969 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:37:16,975 INFO L101 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2018-01-31 08:37:17,002 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:37:17,016 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:37:17,049 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:37:17,087 INFO L278 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:37:17,092 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:37:17,099 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:37:17,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:37:17,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:17,127 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:17,127 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-31 08:37:17,151 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int)) (= |c_#length| (store |c_old(#length)| |c_foo_~#a~3.base| (* 4 foo_~n)))) is different from true [2018-01-31 08:37:17,154 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:37:17,154 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:17,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:17,156 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:8, output treesize:7 [2018-01-31 08:37:17,186 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((|v_foo_~#a~3.base_BEFORE_CALL_4| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~3.base_BEFORE_CALL_4|))) (exists ((v_prenex_22 Int)) (= (store |c_old(#length)| |c_foo_~#a~3.base| (* 4 v_prenex_22)) |c_#length|))) is different from true [2018-01-31 08:37:17,191 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:37:17,191 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:17,196 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:17,196 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:22, output treesize:21 [2018-01-31 08:37:17,198 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_22 Int) (|foo_~#a~3.base| Int)) (and (= (select |c_#valid| |foo_~#a~3.base|) 0) (= (store |c_old(#length)| |foo_~#a~3.base| (* 4 v_prenex_22)) |c_#length|))) (exists ((|v_foo_~#a~3.base_BEFORE_CALL_4| Int) (foo_~n Int)) (= (* 4 foo_~n) (select |c_#length| |v_foo_~#a~3.base_BEFORE_CALL_4|)))) is different from true [2018-01-31 08:37:17,222 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 14 treesize of output 17 [2018-01-31 08:37:17,223 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:17,236 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, End of recursive call: 7 dim-0 vars, and 2 xjuncts. [2018-01-31 08:37:17,236 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 5 variables, input treesize:32, output treesize:58 [2018-01-31 08:37:17,405 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) is different from true [2018-01-31 08:37:17,427 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:37:17,441 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:17,445 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:17,446 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:17,447 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:17,447 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-31 08:37:17,490 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) (exists ((v_prenex_26 Int) (|v_foo_~#a~3.base_BEFORE_CALL_4| Int)) (= (* 4 v_prenex_26) (select |c_#length| |v_foo_~#a~3.base_BEFORE_CALL_4|)))) is different from true [2018-01-31 08:37:17,500 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:17,502 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:17,502 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:17,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 9 [2018-01-31 08:37:17,503 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:17,523 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-31 08:37:17,524 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:17,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-01-31 08:37:17,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:49, output treesize:72 [2018-01-31 08:37:17,875 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:37:17,875 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:17,920 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:17,920 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:17,922 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:17,922 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-31 08:37:18,178 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:18,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:18,179 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:18,179 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:18,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-31 08:37:18,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:18,221 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 6 dim-0 vars, and 2 xjuncts. [2018-01-31 08:37:18,222 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:44, output treesize:64 [2018-01-31 08:37:18,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:37:18,433 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:18,436 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:18,437 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:18,438 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:18,438 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-31 08:37:18,479 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) (exists ((|v_foo_~#a~3.base_BEFORE_CALL_4| Int) (v_prenex_35 Int)) (= (* 4 v_prenex_35) (select |c_#length| |v_foo_~#a~3.base_BEFORE_CALL_4|)))) is different from true [2018-01-31 08:37:18,489 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:18,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-31 08:37:18,498 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:18,527 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:18,528 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:18,528 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:18,529 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:18,549 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-01-31 08:37:18,549 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:51, output treesize:78 [2018-01-31 08:37:18,785 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 55 proven. 127 refuted. 0 times theorem prover too weak. 193 trivial. 149 not checked. [2018-01-31 08:37:18,805 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:37:18,805 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 35] total 58 [2018-01-31 08:37:18,806 INFO L409 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-01-31 08:37:18,806 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-01-31 08:37:18,807 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=2498, Unknown=6, NotChecked=642, Total=3422 [2018-01-31 08:37:18,807 INFO L87 Difference]: Start difference. First operand 300 states and 313 transitions. Second operand 59 states. [2018-01-31 08:37:21,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:37:21,812 INFO L93 Difference]: Finished difference Result 335 states and 361 transitions. [2018-01-31 08:37:21,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-01-31 08:37:21,812 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 245 [2018-01-31 08:37:21,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:37:21,814 INFO L225 Difference]: With dead ends: 335 [2018-01-31 08:37:21,814 INFO L226 Difference]: Without dead ends: 334 [2018-01-31 08:37:21,816 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 322 GetRequests, 216 SyntacticMatches, 13 SemanticMatches, 93 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 3047 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=806, Invalid=7035, Unknown=15, NotChecked=1074, Total=8930 [2018-01-31 08:37:21,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-01-31 08:37:21,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 303. [2018-01-31 08:37:21,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-01-31 08:37:21,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 319 transitions. [2018-01-31 08:37:21,846 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 319 transitions. Word has length 245 [2018-01-31 08:37:21,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:37:21,846 INFO L432 AbstractCegarLoop]: Abstraction has 303 states and 319 transitions. [2018-01-31 08:37:21,846 INFO L433 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-01-31 08:37:21,847 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 319 transitions. [2018-01-31 08:37:21,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-01-31 08:37:21,848 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:37:21,849 INFO L351 BasicCegarLoop]: trace histogram [10, 9, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:37:21,849 INFO L371 AbstractCegarLoop]: === Iteration 29 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:37:21,849 INFO L82 PathProgramCache]: Analyzing trace with hash -756227521, now seen corresponding path program 2 times [2018-01-31 08:37:21,849 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:37:21,849 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:37:21,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:21,850 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:37:21,850 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:21,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:37:21,875 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:37:22,538 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 62 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2018-01-31 08:37:22,538 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:37:22,564 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:37:22,569 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:37:22,590 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:37:22,631 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:37:22,637 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:37:22,641 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:37:22,870 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 282 proven. 12 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2018-01-31 08:37:22,889 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:37:22,889 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 18] total 27 [2018-01-31 08:37:22,890 INFO L409 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-01-31 08:37:22,890 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-01-31 08:37:22,890 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=615, Unknown=0, NotChecked=0, Total=702 [2018-01-31 08:37:22,890 INFO L87 Difference]: Start difference. First operand 303 states and 319 transitions. Second operand 27 states. [2018-01-31 08:37:23,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:37:23,616 INFO L93 Difference]: Finished difference Result 462 states and 498 transitions. [2018-01-31 08:37:23,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-01-31 08:37:23,617 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 253 [2018-01-31 08:37:23,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:37:23,618 INFO L225 Difference]: With dead ends: 462 [2018-01-31 08:37:23,618 INFO L226 Difference]: Without dead ends: 318 [2018-01-31 08:37:23,620 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 578 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=316, Invalid=2036, Unknown=0, NotChecked=0, Total=2352 [2018-01-31 08:37:23,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-01-31 08:37:23,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 281. [2018-01-31 08:37:23,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-01-31 08:37:23,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 288 transitions. [2018-01-31 08:37:23,659 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 288 transitions. Word has length 253 [2018-01-31 08:37:23,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:37:23,660 INFO L432 AbstractCegarLoop]: Abstraction has 281 states and 288 transitions. [2018-01-31 08:37:23,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-01-31 08:37:23,660 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 288 transitions. [2018-01-31 08:37:23,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-01-31 08:37:23,663 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:37:23,663 INFO L351 BasicCegarLoop]: trace histogram [14, 14, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:37:23,663 INFO L371 AbstractCegarLoop]: === Iteration 30 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:37:23,663 INFO L82 PathProgramCache]: Analyzing trace with hash -794775868, now seen corresponding path program 6 times [2018-01-31 08:37:23,663 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:37:23,664 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:37:23,664 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:23,664 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:37:23,665 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:37:23,701 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:37:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 487 proven. 57 refuted. 0 times theorem prover too weak. 532 trivial. 0 not checked. [2018-01-31 08:37:24,525 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:37:24,525 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:37:24,530 INFO L101 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2018-01-31 08:37:24,558 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:37:24,578 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:37:24,591 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:37:24,621 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:37:24,692 INFO L310 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued a check-sat command [2018-01-31 08:37:24,695 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:37:24,703 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:37:26,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1076 backedges. 302 proven. 30 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2018-01-31 08:37:26,036 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:37:26,036 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20] total 31 [2018-01-31 08:37:26,037 INFO L409 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-01-31 08:37:26,037 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-01-31 08:37:26,037 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=826, Unknown=0, NotChecked=0, Total=930 [2018-01-31 08:37:26,037 INFO L87 Difference]: Start difference. First operand 281 states and 288 transitions. Second operand 31 states. [2018-01-31 08:37:26,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:37:26,852 INFO L93 Difference]: Finished difference Result 436 states and 455 transitions. [2018-01-31 08:37:26,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-01-31 08:37:26,852 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 329 [2018-01-31 08:37:26,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:37:26,854 INFO L225 Difference]: With dead ends: 436 [2018-01-31 08:37:26,854 INFO L226 Difference]: Without dead ends: 335 [2018-01-31 08:37:26,857 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 321 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1029 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=418, Invalid=3488, Unknown=0, NotChecked=0, Total=3906 [2018-01-31 08:37:26,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-01-31 08:37:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 313. [2018-01-31 08:37:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-01-31 08:37:26,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 325 transitions. [2018-01-31 08:37:26,903 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 325 transitions. Word has length 329 [2018-01-31 08:37:26,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:37:26,904 INFO L432 AbstractCegarLoop]: Abstraction has 313 states and 325 transitions. [2018-01-31 08:37:26,904 INFO L433 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-01-31 08:37:26,904 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 325 transitions. [2018-01-31 08:37:26,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-01-31 08:37:26,908 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:37:26,908 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:37:26,908 INFO L371 AbstractCegarLoop]: === Iteration 31 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:37:26,909 INFO L82 PathProgramCache]: Analyzing trace with hash 720415662, now seen corresponding path program 7 times [2018-01-31 08:37:26,909 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:37:26,909 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:37:26,909 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:26,910 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:37:26,910 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:26,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:37:26,962 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:37:28,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 38 proven. 439 refuted. 0 times theorem prover too weak. 763 trivial. 0 not checked. [2018-01-31 08:37:28,501 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:37:28,501 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:37:28,507 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:37:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:37:28,594 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:37:28,597 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:37:28,597 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:28,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:37:28,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:28,605 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:28,605 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-31 08:37:28,649 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) is different from true [2018-01-31 08:37:28,667 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:37:28,668 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:28,748 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:28,748 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:28,770 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:28,770 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-31 08:37:28,864 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_43 Int) (v_prenex_42 Int)) (= (* 4 v_prenex_42) (select |c_#length| v_prenex_43))) (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0)))) is different from true [2018-01-31 08:37:28,915 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:28,933 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-01-31 08:37:28,933 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:28,945 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:28,946 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:28,946 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:28,947 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:28,955 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:28,955 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:37, output treesize:30 [2018-01-31 08:37:29,085 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:37:29,085 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:29,090 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:29,090 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:29,091 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:29,091 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-31 08:37:29,123 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_45 Int) (v_prenex_44 Int)) (= (* 4 v_prenex_44) (select |c_#length| v_prenex_45))) (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0)))) is different from true [2018-01-31 08:37:29,136 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:29,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-31 08:37:29,145 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:29,211 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:29,212 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:29,212 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:29,213 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:29,231 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-01-31 08:37:29,232 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:48, output treesize:72 [2018-01-31 08:37:29,384 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:37:29,384 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:29,388 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:29,388 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:29,389 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:29,389 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-31 08:37:29,426 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) (exists ((v_prenex_52 Int) (v_prenex_53 Int)) (= (* 4 v_prenex_52) (select |c_#length| v_prenex_53)))) is different from true [2018-01-31 08:37:29,458 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:29,467 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-31 08:37:29,468 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:29,496 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:29,497 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:29,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:29,497 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:29,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-01-31 08:37:29,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:48, output treesize:72 [2018-01-31 08:37:29,689 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:37:29,689 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:29,692 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:29,693 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:29,694 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:29,694 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-31 08:37:29,728 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) (exists ((v_prenex_61 Int) (v_prenex_60 Int)) (= (* 4 v_prenex_60) (select |c_#length| v_prenex_61)))) is different from true [2018-01-31 08:37:29,779 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:29,809 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:29,810 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:29,810 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:30,014 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-31 08:37:30,015 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:30,039 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-01-31 08:37:30,039 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:48, output treesize:72 [2018-01-31 08:37:30,230 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:37:30,230 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:30,234 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:30,234 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:30,235 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:30,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-31 08:37:30,275 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_69 Int) (v_prenex_68 Int)) (= (* 4 v_prenex_68) (select |c_#length| v_prenex_69))) (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0)))) is different from true [2018-01-31 08:37:30,291 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:30,292 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:30,292 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:30,292 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:30,314 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-31 08:37:30,314 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:30,362 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-01-31 08:37:30,363 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:48, output treesize:72 [2018-01-31 08:37:30,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1240 backedges. 0 proven. 74 refuted. 0 times theorem prover too weak. 1110 trivial. 56 not checked. [2018-01-31 08:37:30,737 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:37:30,738 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 25] total 52 [2018-01-31 08:37:30,738 INFO L409 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-01-31 08:37:30,739 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-01-31 08:37:30,739 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=294, Invalid=1886, Unknown=6, NotChecked=570, Total=2756 [2018-01-31 08:37:30,739 INFO L87 Difference]: Start difference. First operand 313 states and 325 transitions. Second operand 53 states. [2018-01-31 08:37:32,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:37:32,241 INFO L93 Difference]: Finished difference Result 320 states and 333 transitions. [2018-01-31 08:37:32,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-31 08:37:32,241 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 345 [2018-01-31 08:37:32,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:37:32,243 INFO L225 Difference]: With dead ends: 320 [2018-01-31 08:37:32,243 INFO L226 Difference]: Without dead ends: 319 [2018-01-31 08:37:32,244 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 404 GetRequests, 328 SyntacticMatches, 10 SemanticMatches, 66 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=507, Invalid=3293, Unknown=6, NotChecked=750, Total=4556 [2018-01-31 08:37:32,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-01-31 08:37:32,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 316. [2018-01-31 08:37:32,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 316 states. [2018-01-31 08:37:32,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 329 transitions. [2018-01-31 08:37:32,288 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 329 transitions. Word has length 345 [2018-01-31 08:37:32,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:37:32,289 INFO L432 AbstractCegarLoop]: Abstraction has 316 states and 329 transitions. [2018-01-31 08:37:32,289 INFO L433 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-01-31 08:37:32,289 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 329 transitions. [2018-01-31 08:37:32,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-01-31 08:37:32,292 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:37:32,292 INFO L351 BasicCegarLoop]: trace histogram [15, 15, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:37:32,293 INFO L371 AbstractCegarLoop]: === Iteration 32 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:37:32,293 INFO L82 PathProgramCache]: Analyzing trace with hash 1738699844, now seen corresponding path program 3 times [2018-01-31 08:37:32,293 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:37:32,293 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:37:32,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:32,294 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:37:32,294 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:32,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:37:32,324 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:37:32,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 1166 trivial. 0 not checked. [2018-01-31 08:37:32,880 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:37:32,880 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:37:32,886 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:37:32,909 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:37:32,916 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:37:32,925 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:37:32,938 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:37:32,976 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:37:33,059 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:37:33,063 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:37:33,070 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:37:33,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1266 backedges. 318 proven. 56 refuted. 0 times theorem prover too weak. 892 trivial. 0 not checked. [2018-01-31 08:37:33,433 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:37:33,433 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 24 [2018-01-31 08:37:33,434 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-01-31 08:37:33,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-01-31 08:37:33,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=457, Unknown=0, NotChecked=0, Total=552 [2018-01-31 08:37:33,434 INFO L87 Difference]: Start difference. First operand 316 states and 329 transitions. Second operand 24 states. [2018-01-31 08:37:34,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:37:34,019 INFO L93 Difference]: Finished difference Result 472 states and 501 transitions. [2018-01-31 08:37:34,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-01-31 08:37:34,019 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 361 [2018-01-31 08:37:34,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:37:34,023 INFO L225 Difference]: With dead ends: 472 [2018-01-31 08:37:34,023 INFO L226 Difference]: Without dead ends: 448 [2018-01-31 08:37:34,024 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=547, Invalid=2533, Unknown=0, NotChecked=0, Total=3080 [2018-01-31 08:37:34,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 448 states. [2018-01-31 08:37:34,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 448 to 406. [2018-01-31 08:37:34,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-01-31 08:37:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 430 transitions. [2018-01-31 08:37:34,085 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 430 transitions. Word has length 361 [2018-01-31 08:37:34,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:37:34,086 INFO L432 AbstractCegarLoop]: Abstraction has 406 states and 430 transitions. [2018-01-31 08:37:34,086 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-01-31 08:37:34,086 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 430 transitions. [2018-01-31 08:37:34,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-01-31 08:37:34,090 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:37:34,090 INFO L351 BasicCegarLoop]: trace histogram [20, 20, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:37:34,091 INFO L371 AbstractCegarLoop]: === Iteration 33 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:37:34,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1490102782, now seen corresponding path program 8 times [2018-01-31 08:37:34,091 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:37:34,091 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:37:34,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:34,092 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:37:34,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:37:34,136 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:37:34,920 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 522 proven. 91 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2018-01-31 08:37:34,920 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:37:34,920 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:37:34,928 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:37:34,968 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:37:35,056 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:37:35,072 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:37:35,082 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:37:35,394 INFO L134 CoverageAnalysis]: Checked inductivity of 2280 backedges. 557 proven. 56 refuted. 0 times theorem prover too weak. 1667 trivial. 0 not checked. [2018-01-31 08:37:35,415 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:37:35,415 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 35 [2018-01-31 08:37:35,415 INFO L409 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-01-31 08:37:35,415 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-01-31 08:37:35,416 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1021, Unknown=0, NotChecked=0, Total=1190 [2018-01-31 08:37:35,416 INFO L87 Difference]: Start difference. First operand 406 states and 430 transitions. Second operand 35 states. [2018-01-31 08:37:36,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:37:36,165 INFO L93 Difference]: Finished difference Result 600 states and 637 transitions. [2018-01-31 08:37:36,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-01-31 08:37:36,165 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 445 [2018-01-31 08:37:36,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:37:36,168 INFO L225 Difference]: With dead ends: 600 [2018-01-31 08:37:36,168 INFO L226 Difference]: Without dead ends: 438 [2018-01-31 08:37:36,169 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 492 GetRequests, 435 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 908 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=494, Invalid=2928, Unknown=0, NotChecked=0, Total=3422 [2018-01-31 08:37:36,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-01-31 08:37:36,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 383. [2018-01-31 08:37:36,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-01-31 08:37:36,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 400 transitions. [2018-01-31 08:37:36,225 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 400 transitions. Word has length 445 [2018-01-31 08:37:36,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:37:36,226 INFO L432 AbstractCegarLoop]: Abstraction has 383 states and 400 transitions. [2018-01-31 08:37:36,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-01-31 08:37:36,227 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 400 transitions. [2018-01-31 08:37:36,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2018-01-31 08:37:36,231 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:37:36,231 INFO L351 BasicCegarLoop]: trace histogram [21, 20, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:37:36,231 INFO L371 AbstractCegarLoop]: === Iteration 34 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:37:36,231 INFO L82 PathProgramCache]: Analyzing trace with hash 643680051, now seen corresponding path program 9 times [2018-01-31 08:37:36,232 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:37:36,232 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:37:36,232 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:36,233 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:37:36,233 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:37:36,275 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:37:37,765 INFO L134 CoverageAnalysis]: Checked inductivity of 2404 backedges. 980 proven. 113 refuted. 0 times theorem prover too weak. 1311 trivial. 0 not checked. [2018-01-31 08:37:37,765 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:37:37,765 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:37:37,770 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:37:37,798 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:37:37,807 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:37:37,821 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:37:37,843 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:37:37,972 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:37:38,228 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:37:38,233 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:37:38,243 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:37:39,150 INFO L134 CoverageAnalysis]: Checked inductivity of 2404 backedges. 1157 proven. 274 refuted. 0 times theorem prover too weak. 973 trivial. 0 not checked. [2018-01-31 08:37:39,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:37:39,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 30] total 49 [2018-01-31 08:37:39,176 INFO L409 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-01-31 08:37:39,176 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-01-31 08:37:39,176 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2143, Unknown=0, NotChecked=0, Total=2352 [2018-01-31 08:37:39,176 INFO L87 Difference]: Start difference. First operand 383 states and 400 transitions. Second operand 49 states. [2018-01-31 08:37:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:37:41,038 INFO L93 Difference]: Finished difference Result 731 states and 786 transitions. [2018-01-31 08:37:41,038 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-01-31 08:37:41,038 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 453 [2018-01-31 08:37:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:37:41,041 INFO L225 Difference]: With dead ends: 731 [2018-01-31 08:37:41,041 INFO L226 Difference]: Without dead ends: 507 [2018-01-31 08:37:41,044 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 530 GetRequests, 428 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3058 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1182, Invalid=9530, Unknown=0, NotChecked=0, Total=10712 [2018-01-31 08:37:41,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 507 states. [2018-01-31 08:37:41,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 507 to 468. [2018-01-31 08:37:41,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-01-31 08:37:41,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 492 transitions. [2018-01-31 08:37:41,119 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 492 transitions. Word has length 453 [2018-01-31 08:37:41,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:37:41,120 INFO L432 AbstractCegarLoop]: Abstraction has 468 states and 492 transitions. [2018-01-31 08:37:41,120 INFO L433 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-01-31 08:37:41,120 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 492 transitions. [2018-01-31 08:37:41,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 462 [2018-01-31 08:37:41,124 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:37:41,124 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:37:41,124 INFO L371 AbstractCegarLoop]: === Iteration 35 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:37:41,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1823280408, now seen corresponding path program 10 times [2018-01-31 08:37:41,124 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:37:41,125 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:37:41,125 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:41,126 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:37:41,126 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:41,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:37:41,195 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:37:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 214 proven. 815 refuted. 0 times theorem prover too weak. 1499 trivial. 0 not checked. [2018-01-31 08:37:43,213 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:37:43,214 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:37:43,219 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:37:43,493 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:37:43,504 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:37:43,519 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:37:43,520 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:43,530 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2018-01-31 08:37:43,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:43,534 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:43,534 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:16, output treesize:14 [2018-01-31 08:37:43,575 WARN L1033 $PredicateComparison]: unable to prove that (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) is different from true [2018-01-31 08:37:43,579 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:37:43,579 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:43,583 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:43,583 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:43,585 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:43,585 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-31 08:37:43,617 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) (exists ((v_prenex_77 Int) (v_prenex_76 Int)) (= (* 4 v_prenex_76) (select |c_#length| v_prenex_77)))) is different from true [2018-01-31 08:37:43,624 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:43,625 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:43,625 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:43,626 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:43,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 17 [2018-01-31 08:37:43,658 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:43,668 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-1 vars, End of recursive call: 4 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:43,669 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 6 variables, input treesize:37, output treesize:30 [2018-01-31 08:37:43,849 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:37:43,850 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:43,940 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:43,941 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:43,966 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:43,966 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-31 08:37:43,999 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_78 Int) (v_prenex_79 Int)) (= (* 4 v_prenex_78) (select |c_#length| v_prenex_79))) (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0)))) is different from true [2018-01-31 08:37:44,046 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:44,071 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:44,072 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:44,072 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:44,180 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-31 08:37:44,180 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:44,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-01-31 08:37:44,235 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:55, output treesize:86 [2018-01-31 08:37:44,433 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:37:44,434 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:44,513 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:44,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:44,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:44,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-31 08:37:44,569 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_87 Int) (v_prenex_86 Int)) (= (* 4 v_prenex_86) (select |c_#length| v_prenex_87))) (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0)))) is different from true [2018-01-31 08:37:44,621 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:44,647 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:44,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:44,648 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:44,993 INFO L303 Elim1Store]: Index analysis took 110 ms [2018-01-31 08:37:45,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-31 08:37:45,115 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:45,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-01-31 08:37:45,570 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:55, output treesize:86 [2018-01-31 08:37:45,787 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:37:45,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:45,793 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:45,794 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:45,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:45,795 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-31 08:37:45,807 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) (exists ((v_prenex_95 Int) (v_prenex_94 Int)) (= (* 4 v_prenex_94) (select |c_#length| v_prenex_95)))) is different from true [2018-01-31 08:37:45,815 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:45,825 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-31 08:37:45,826 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:45,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:45,857 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:45,858 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:45,858 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:45,879 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-01-31 08:37:45,880 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:55, output treesize:86 [2018-01-31 08:37:46,090 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:46,090 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:46,092 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:37:46,092 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:46,094 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:46,094 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-31 08:37:46,141 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) (exists ((v_prenex_103 Int) (v_prenex_102 Int)) (= (* 4 v_prenex_102) (select |c_#length| v_prenex_103)))) is different from true [2018-01-31 08:37:46,190 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:46,212 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:46,213 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:46,213 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:46,357 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-31 08:37:46,357 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:46,383 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-01-31 08:37:46,383 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:55, output treesize:86 [2018-01-31 08:37:46,611 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:46,612 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:46,614 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:37:46,615 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:46,616 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-01-31 08:37:46,616 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:14, output treesize:7 [2018-01-31 08:37:46,662 WARN L1033 $PredicateComparison]: unable to prove that (and (exists ((v_prenex_110 Int) (v_prenex_111 Int)) (= (* 4 v_prenex_110) (select |c_#length| v_prenex_111))) (exists ((foo_~n Int) (|foo_~#a~3.base| Int)) (and (= |c_#length| (store |c_old(#length)| |foo_~#a~3.base| (* 4 foo_~n))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0)))) is different from true [2018-01-31 08:37:46,728 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:46,805 INFO L303 Elim1Store]: Index analysis took 133 ms [2018-01-31 08:37:46,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 32 [2018-01-31 08:37:46,939 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:47,549 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:47,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:47,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:47,575 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:47,854 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 2 dim-1 vars, End of recursive call: 10 dim-0 vars, and 2 xjuncts. [2018-01-31 08:37:47,855 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 8 variables, input treesize:55, output treesize:86 [2018-01-31 08:37:48,531 INFO L134 CoverageAnalysis]: Checked inductivity of 2528 backedges. 0 proven. 115 refuted. 0 times theorem prover too weak. 2325 trivial. 88 not checked. [2018-01-31 08:37:48,552 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:37:48,552 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 29] total 59 [2018-01-31 08:37:48,553 INFO L409 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-01-31 08:37:48,553 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-01-31 08:37:48,553 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=2433, Unknown=7, NotChecked=756, Total=3540 [2018-01-31 08:37:48,553 INFO L87 Difference]: Start difference. First operand 468 states and 492 transitions. Second operand 60 states. [2018-01-31 08:37:50,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:37:50,287 INFO L93 Difference]: Finished difference Result 475 states and 500 transitions. [2018-01-31 08:37:50,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-01-31 08:37:50,287 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 461 [2018-01-31 08:37:50,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:37:50,290 INFO L225 Difference]: With dead ends: 475 [2018-01-31 08:37:50,290 INFO L226 Difference]: Without dead ends: 474 [2018-01-31 08:37:50,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 536 GetRequests, 447 SyntacticMatches, 11 SemanticMatches, 78 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 2113 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=675, Invalid=4602, Unknown=7, NotChecked=1036, Total=6320 [2018-01-31 08:37:50,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 474 states. [2018-01-31 08:37:50,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 474 to 471. [2018-01-31 08:37:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-01-31 08:37:50,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 496 transitions. [2018-01-31 08:37:50,348 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 496 transitions. Word has length 461 [2018-01-31 08:37:50,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:37:50,349 INFO L432 AbstractCegarLoop]: Abstraction has 471 states and 496 transitions. [2018-01-31 08:37:50,349 INFO L433 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-01-31 08:37:50,349 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 496 transitions. [2018-01-31 08:37:50,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2018-01-31 08:37:50,354 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:37:50,355 INFO L351 BasicCegarLoop]: trace histogram [21, 21, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:37:50,355 INFO L371 AbstractCegarLoop]: === Iteration 36 === [barErr1RequiresViolation, barErr0RequiresViolation, fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-31 08:37:50,355 INFO L82 PathProgramCache]: Analyzing trace with hash 789776254, now seen corresponding path program 4 times [2018-01-31 08:37:50,355 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:37:50,355 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:37:50,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:50,356 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:37:50,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:37:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:37:50,392 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:37:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 2560 backedges. 0 proven. 147 refuted. 0 times theorem prover too weak. 2413 trivial. 0 not checked. [2018-01-31 08:37:51,168 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:37:51,169 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/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 [2018-01-31 08:37:51,173 INFO L101 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-01-31 08:37:51,312 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:37:51,326 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:37:51,702 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 15 treesize of output 12 [2018-01-31 08:37:51,704 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-31 08:37:51,704 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:51,705 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:51,709 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:51,709 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:24, output treesize:20 [2018-01-31 08:37:51,782 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~3.offset| Int) (foo_~i~3 Int) (|foo_#t~mem4| Int) (|foo_~#a~3.base| Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |foo_~#a~3.base| (store (select |c_old(#memory_int)| |foo_~#a~3.base|) (+ |foo_~#a~3.offset| (* 4 foo_~i~3)) |foo_#t~mem4|))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) is different from true [2018-01-31 08:37:51,789 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:51,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:51,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 15 treesize of output 12 [2018-01-31 08:37:51,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-31 08:37:51,793 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:51,794 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:51,795 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:51,796 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:21, output treesize:1 [2018-01-31 08:37:51,803 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:51,804 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:51,804 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:51,805 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:51,835 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-01-31 08:37:51,837 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-01-31 08:37:51,837 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:51,842 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:51,847 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:51,847 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 6 variables, input treesize:36, output treesize:11 [2018-01-31 08:37:51,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 23 treesize of output 18 [2018-01-31 08:37:51,904 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:51,930 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-31 08:37:51,931 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:52,030 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:52,148 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:52,148 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-01-31 08:37:52,438 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~3.offset| Int) (foo_~i~3 Int) (|foo_#t~mem4| Int) (|foo_~#a~3.base| Int) (v_prenex_118 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |foo_~#a~3.base| (store (store (select |c_old(#memory_int)| |foo_~#a~3.base|) |foo_~#a~3.offset| v_prenex_118) (+ |foo_~#a~3.offset| (* 4 foo_~i~3)) |foo_#t~mem4|))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) is different from true [2018-01-31 08:37:52,444 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:52,444 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:52,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 18 treesize of output 15 [2018-01-31 08:37:52,449 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2018-01-31 08:37:52,457 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2018-01-31 08:37:52,457 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:52,466 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:37:52,473 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:37:52,481 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:52,481 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:24, output treesize:1 [2018-01-31 08:37:52,491 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:52,492 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:52,492 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:52,492 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:52,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-01-31 08:37:52,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 15 treesize of output 18 [2018-01-31 08:37:52,517 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 27 [2018-01-31 08:37:52,517 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:52,524 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:37:52,535 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-01-31 08:37:52,548 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:52,549 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 7 variables, input treesize:39, output treesize:11 [2018-01-31 08:37:52,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 23 treesize of output 18 [2018-01-31 08:37:52,574 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:52,575 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-31 08:37:52,576 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:52,580 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:52,586 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:52,586 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-01-31 08:37:52,720 WARN L1033 $PredicateComparison]: unable to prove that (exists ((|foo_~#a~3.offset| Int) (v_prenex_121 Int) (v_prenex_120 Int) (foo_~i~3 Int) (|foo_#t~mem4| Int) (|foo_~#a~3.base| Int) (v_prenex_119 Int)) (and (= |c_#memory_int| (store |c_old(#memory_int)| |foo_~#a~3.base| (store (store (store (select |c_old(#memory_int)| |foo_~#a~3.base|) |foo_~#a~3.offset| v_prenex_119) (+ |foo_~#a~3.offset| (* 4 v_prenex_120)) v_prenex_121) (+ |foo_~#a~3.offset| (* 4 foo_~i~3)) |foo_#t~mem4|))) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) is different from true [2018-01-31 08:37:52,730 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:52,730 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:52,734 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 25 treesize of output 22 [2018-01-31 08:37:52,736 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 22 treesize of output 25 [2018-01-31 08:37:52,745 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 35 [2018-01-31 08:37:52,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 42 [2018-01-31 08:37:52,754 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:52,791 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 62 [2018-01-31 08:37:52,792 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 8 xjuncts. [2018-01-31 08:37:52,833 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-31 08:37:52,877 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-31 08:37:52,902 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-31 08:37:52,927 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:52,928 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:31, output treesize:1 [2018-01-31 08:37:52,939 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:52,940 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:52,940 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:52,940 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:52,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 34 [2018-01-31 08:37:52,953 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 22 treesize of output 25 [2018-01-31 08:37:52,961 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 35 [2018-01-31 08:37:52,980 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 27 treesize of output 62 [2018-01-31 08:37:52,981 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 8 xjuncts. [2018-01-31 08:37:53,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 42 [2018-01-31 08:37:53,029 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:53,058 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-31 08:37:53,084 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-31 08:37:53,113 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-31 08:37:53,150 INFO L267 ElimStorePlain]: Start of recursive call 1: 7 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:53,150 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:46, output treesize:11 [2018-01-31 08:37:53,173 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 23 treesize of output 18 [2018-01-31 08:37:53,176 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:53,177 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-31 08:37:53,177 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:53,181 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:53,186 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:53,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-01-31 08:37:53,302 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_127 Int) (v_prenex_128 Int) (v_prenex_125 Int) (v_prenex_126 Int) (|foo_~#a~3.offset| Int) (foo_~i~3 Int) (|foo_#t~mem4| Int) (|foo_~#a~3.base| Int) (v_prenex_119 Int)) (and (= (store |c_old(#memory_int)| |foo_~#a~3.base| (store (store (store (store (select |c_old(#memory_int)| |foo_~#a~3.base|) |foo_~#a~3.offset| v_prenex_119) (+ (* 4 v_prenex_125) |foo_~#a~3.offset|) v_prenex_126) (+ (* 4 v_prenex_127) |foo_~#a~3.offset|) v_prenex_128) (+ |foo_~#a~3.offset| (* 4 foo_~i~3)) |foo_#t~mem4|)) |c_#memory_int|) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) is different from true [2018-01-31 08:37:53,312 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:53,313 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:53,317 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 32 treesize of output 29 [2018-01-31 08:37:53,319 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 29 treesize of output 32 [2018-01-31 08:37:53,328 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2018-01-31 08:37:53,352 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 68 [2018-01-31 08:37:53,355 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-31 08:37:53,355 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:53,439 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 56 [2018-01-31 08:37:53,440 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:53,521 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:53,536 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 77 [2018-01-31 08:37:53,536 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 4 xjuncts. [2018-01-31 08:37:53,633 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:53,647 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 85 [2018-01-31 08:37:53,648 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-01-31 08:37:53,930 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:37:53,958 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 39 treesize of output 104 [2018-01-31 08:37:53,960 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 16 xjuncts. [2018-01-31 08:37:54,163 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 113 [2018-01-31 08:37:54,163 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-31 08:37:54,171 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 64 xjuncts. [2018-01-31 08:37:54,510 INFO L267 ElimStorePlain]: Start of recursive call 6: 8 dim-1 vars, End of recursive call: and 14 xjuncts. [2018-01-31 08:37:54,637 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 50 [2018-01-31 08:37:54,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 53 [2018-01-31 08:37:54,646 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:54,686 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 81 [2018-01-31 08:37:54,688 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2018-01-31 08:37:54,735 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-31 08:37:54,853 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-01-31 08:37:54,957 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-01-31 08:37:55,060 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-01-31 08:37:55,165 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:55,165 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 11 variables, input treesize:38, output treesize:1 [2018-01-31 08:37:55,179 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:55,180 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:55,181 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-01-31 08:37:55,181 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:55,194 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 41 [2018-01-31 08:37:55,196 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 29 treesize of output 32 [2018-01-31 08:37:55,205 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 42 [2018-01-31 08:37:55,228 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 68 [2018-01-31 08:37:55,239 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:37:55,268 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 39 treesize of output 104 [2018-01-31 08:37:55,270 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 16 xjuncts. [2018-01-31 08:37:55,669 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 36 treesize of output 113 [2018-01-31 08:37:55,669 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-31 08:37:55,675 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 64 xjuncts. [2018-01-31 08:37:56,051 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 56 [2018-01-31 08:37:56,051 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:56,196 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:56,211 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 85 [2018-01-31 08:37:56,211 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 4 xjuncts. [2018-01-31 08:37:56,365 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 76 [2018-01-31 08:37:56,366 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 8 xjuncts. [2018-01-31 08:37:56,667 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:56,682 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 46 treesize of output 77 [2018-01-31 08:37:56,682 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-01-31 08:37:56,803 INFO L267 ElimStorePlain]: Start of recursive call 6: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-01-31 08:37:56,931 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 36 treesize of output 50 [2018-01-31 08:37:56,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 53 [2018-01-31 08:37:56,940 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-01-31 08:37:56,998 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 81 [2018-01-31 08:37:56,999 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2018-01-31 08:37:57,047 INFO L267 ElimStorePlain]: Start of recursive call 13: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-31 08:37:57,194 INFO L267 ElimStorePlain]: Start of recursive call 5: 2 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-01-31 08:37:57,299 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-01-31 08:37:57,409 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-01-31 08:37:57,541 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:57,542 INFO L202 ElimStorePlain]: Needed 15 recursive calls to eliminate 11 variables, input treesize:53, output treesize:11 [2018-01-31 08:37:57,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 23 treesize of output 18 [2018-01-31 08:37:57,568 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:57,569 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 27 [2018-01-31 08:37:57,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:57,573 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:57,578 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:37:57,578 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:31, output treesize:16 [2018-01-31 08:37:58,289 WARN L1033 $PredicateComparison]: unable to prove that (exists ((v_prenex_125 Int) (v_prenex_126 Int) (|foo_~#a~3.offset| Int) (v_prenex_152 Int) (v_prenex_153 Int) (v_prenex_150 Int) (v_prenex_151 Int) (foo_~i~3 Int) (|foo_#t~mem4| Int) (|foo_~#a~3.base| Int) (v_prenex_119 Int)) (and (= (store |c_old(#memory_int)| |foo_~#a~3.base| (store (store (store (store (store (select |c_old(#memory_int)| |foo_~#a~3.base|) |foo_~#a~3.offset| v_prenex_119) (+ (* 4 v_prenex_125) |foo_~#a~3.offset|) v_prenex_126) (+ |foo_~#a~3.offset| (* 4 v_prenex_150)) v_prenex_151) (+ |foo_~#a~3.offset| (* 4 v_prenex_152)) v_prenex_153) (+ |foo_~#a~3.offset| (* 4 foo_~i~3)) |foo_#t~mem4|)) |c_#memory_int|) (= (select |c_old(#valid)| |foo_~#a~3.base|) 0))) is different from true [2018-01-31 08:37:58,316 INFO L477 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 1 [2018-01-31 08:37:58,317 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:37:58,323 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 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 39 treesize of output 36 [2018-01-31 08:37:58,327 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 36 treesize of output 39 [2018-01-31 08:37:58,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 49 [2018-01-31 08:37:58,349 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 57 [2018-01-31 08:37:58,371 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 45 treesize of output 87 [2018-01-31 08:37:58,375 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:58,390 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 100 [2018-01-31 08:37:58,390 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-01-31 08:37:58,521 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:37:58,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 123 [2018-01-31 08:37:58,552 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 16 xjuncts. [2018-01-31 08:37:59,145 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 47 treesize of output 136 [2018-01-31 08:37:59,146 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-31 08:37:59,152 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 64 xjuncts. [2018-01-31 08:37:59,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 95 [2018-01-31 08:37:59,609 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 8 xjuncts. [2018-01-31 08:37:59,803 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:37:59,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 61 treesize of output 100 [2018-01-31 08:37:59,819 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 4 xjuncts. [2018-01-31 08:37:59,983 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 67 [2018-01-31 08:37:59,984 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 2 xjuncts. [2018-01-31 08:38:00,120 INFO L267 ElimStorePlain]: Start of recursive call 7: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-01-31 08:38:00,275 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 61 [2018-01-31 08:38:00,295 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 49 treesize of output 92 [2018-01-31 08:38:00,321 INFO L267 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 8 xjuncts. [2018-01-31 08:38:00,388 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 64 [2018-01-31 08:38:00,388 INFO L267 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 2 xjuncts. [2018-01-31 08:38:00,435 INFO L267 ElimStorePlain]: Start of recursive call 14: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-31 08:38:00,588 INFO L267 ElimStorePlain]: Start of recursive call 6: 2 dim-1 vars, End of recursive call: and 15 xjuncts. [2018-01-31 08:38:00,771 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 41 treesize of output 75 [2018-01-31 08:38:00,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 48 treesize of output 82 [2018-01-31 08:38:00,815 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 90 [2018-01-31 08:38:00,816 INFO L267 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 8 xjuncts. [2018-01-31 08:38:01,142 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:01,157 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 99 [2018-01-31 08:38:01,158 INFO L267 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 4 xjuncts. [2018-01-31 08:38:01,326 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 70 [2018-01-31 08:38:01,327 INFO L267 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 2 xjuncts. [2018-01-31 08:38:01,477 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:38:01,506 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 118 [2018-01-31 08:38:01,507 INFO L267 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 16 xjuncts. [2018-01-31 08:38:01,954 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 9 case distinctions, treesize of input 50 treesize of output 127 [2018-01-31 08:38:01,955 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-31 08:38:01,959 INFO L267 ElimStorePlain]: Start of recursive call 23: End of recursive call: and 64 xjuncts. [2018-01-31 08:38:02,389 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:02,403 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 91 [2018-01-31 08:38:02,404 INFO L267 ElimStorePlain]: Start of recursive call 24: End of recursive call: and 4 xjuncts. [2018-01-31 08:38:02,566 INFO L267 ElimStorePlain]: Start of recursive call 18: 8 dim-1 vars, End of recursive call: and 13 xjuncts. [2018-01-31 08:38:02,834 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:02,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 4 case distinctions, treesize of input 53 treesize of output 91 [2018-01-31 08:38:02,855 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:02,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 67 treesize of output 140 [2018-01-31 08:38:02,892 INFO L267 ElimStorePlain]: Start of recursive call 26: End of recursive call: and 32 xjuncts. [2018-01-31 08:38:03,089 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:03,105 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 96 [2018-01-31 08:38:03,105 INFO L267 ElimStorePlain]: Start of recursive call 27: End of recursive call: and 4 xjuncts. [2018-01-31 08:38:03,316 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:03,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 57 treesize of output 96 [2018-01-31 08:38:03,331 INFO L267 ElimStorePlain]: Start of recursive call 28: End of recursive call: and 4 xjuncts. [2018-01-31 08:38:03,447 INFO L267 ElimStorePlain]: Start of recursive call 25: 4 dim-1 vars, End of recursive call: and 10 xjuncts. [2018-01-31 08:38:03,838 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:38:03,866 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 8 case distinctions, treesize of input 46 treesize of output 108 [2018-01-31 08:38:03,870 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-01-31 08:38:03,870 INFO L267 ElimStorePlain]: Start of recursive call 30: End of recursive call: and 1 xjuncts. [2018-01-31 08:38:04,096 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 98 [2018-01-31 08:38:04,096 INFO L267 ElimStorePlain]: Start of recursive call 31: End of recursive call: and 8 xjuncts. [2018-01-31 08:38:04,692 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 118 [2018-01-31 08:38:04,693 INFO L267 ElimStorePlain]: Start of recursive call 32: End of recursive call: and 16 xjuncts. [2018-01-31 08:38:05,152 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 98 [2018-01-31 08:38:05,153 INFO L267 ElimStorePlain]: Start of recursive call 33: End of recursive call: and 8 xjuncts. [2018-01-31 08:38:05,600 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:05,601 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:05,683 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 68 treesize of output 163 [2018-01-31 08:38:05,684 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-01-31 08:38:05,695 INFO L267 ElimStorePlain]: Start of recursive call 34: End of recursive call: and 64 xjuncts. [2018-01-31 08:38:06,724 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:06,725 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:06,754 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 70 treesize of output 139 [2018-01-31 08:38:06,755 INFO L267 ElimStorePlain]: Start of recursive call 35: End of recursive call: and 16 xjuncts. [2018-01-31 08:38:07,425 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:38:07,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 126 [2018-01-31 08:38:07,456 INFO L267 ElimStorePlain]: Start of recursive call 36: End of recursive call: and 16 xjuncts. [2018-01-31 08:38:08,696 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:08,697 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:08,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 70 treesize of output 131 [2018-01-31 08:38:08,726 INFO L267 ElimStorePlain]: Start of recursive call 37: End of recursive call: and 16 xjuncts. [2018-01-31 08:38:09,403 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:38:09,431 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 118 [2018-01-31 08:38:09,433 INFO L267 ElimStorePlain]: Start of recursive call 38: End of recursive call: and 16 xjuncts. [2018-01-31 08:38:10,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 13 case distinctions, treesize of input 48 treesize of output 171 [2018-01-31 08:38:10,203 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 9 [2018-01-31 08:38:10,214 INFO L267 ElimStorePlain]: Start of recursive call 39: End of recursive call: and 128 xjuncts. [2018-01-31 08:38:11,776 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:11,779 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:11,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 70 treesize of output 127 [2018-01-31 08:38:11,802 INFO L267 ElimStorePlain]: Start of recursive call 40: End of recursive call: and 8 xjuncts. [2018-01-31 08:38:12,405 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:12,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 60 treesize of output 99 [2018-01-31 08:38:12,426 INFO L267 ElimStorePlain]: Start of recursive call 41: End of recursive call: and 4 xjuncts. [2018-01-31 08:38:12,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 55 treesize of output 90 [2018-01-31 08:38:12,967 INFO L267 ElimStorePlain]: Start of recursive call 42: End of recursive call: and 8 xjuncts. [2018-01-31 08:38:13,509 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 70 [2018-01-31 08:38:13,510 INFO L267 ElimStorePlain]: Start of recursive call 43: End of recursive call: and 2 xjuncts. [2018-01-31 08:38:13,983 INFO L267 ElimStorePlain]: Start of recursive call 29: 16 dim-1 vars, End of recursive call: and 35 xjuncts. [2018-01-31 08:38:14,769 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 64 [2018-01-31 08:38:14,790 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 5 case distinctions, treesize of input 52 treesize of output 95 [2018-01-31 08:38:14,791 INFO L267 ElimStorePlain]: Start of recursive call 45: End of recursive call: and 8 xjuncts. [2018-01-31 08:38:14,867 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 67 [2018-01-31 08:38:14,867 INFO L267 ElimStorePlain]: Start of recursive call 46: End of recursive call: and 2 xjuncts. [2018-01-31 08:38:14,921 INFO L267 ElimStorePlain]: Start of recursive call 44: 2 dim-1 vars, End of recursive call: and 5 xjuncts. [2018-01-31 08:38:15,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 9 case distinctions, treesize of input 43 treesize of output 117 [2018-01-31 08:38:15,653 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 6 [2018-01-31 08:38:15,660 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:15,676 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 63 treesize of output 102 [2018-01-31 08:38:15,677 INFO L267 ElimStorePlain]: Start of recursive call 48: End of recursive call: and 4 xjuncts. [2018-01-31 08:38:17,611 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:17,614 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:38:17,659 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 61 treesize of output 130 [2018-01-31 08:38:17,660 INFO L267 ElimStorePlain]: Start of recursive call 49: End of recursive call: and 16 xjuncts. [2018-01-31 08:38:21,018 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:21,020 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:21,022 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:38:21,045 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 6 case distinctions, treesize of input 66 treesize of output 131 [2018-01-31 08:38:21,045 INFO L267 ElimStorePlain]: Start of recursive call 50: End of recursive call: and 8 xjuncts. [2018-01-31 08:38:22,746 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:22,752 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:38:22,792 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 7 case distinctions, treesize of input 65 treesize of output 126 [2018-01-31 08:38:22,794 INFO L267 ElimStorePlain]: Start of recursive call 51: End of recursive call: and 16 xjuncts. [2018-01-31 08:38:27,891 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 57 treesize of output 70 [2018-01-31 08:38:27,892 INFO L267 ElimStorePlain]: Start of recursive call 52: End of recursive call: and 2 xjuncts. [2018-01-31 08:38:29,485 INFO L700 Elim1Store]: detected not equals via solver [2018-01-31 08:38:29,489 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:38:29,491 INFO L682 Elim1Store]: detected equality via solver [2018-01-31 08:38:29,534 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 11 case distinctions, treesize of input 59 treesize of output 157 [2018-01-31 08:38:29,534 WARN L130 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-01-31 08:38:29,537 INFO L267 ElimStorePlain]: Start of recursive call 53: End of recursive call: and 32 xjuncts. Received shutdown request... [2018-01-31 08:38:30,107 INFO L175 TraceCheckSpWp]: Timeout while computing interpolants [2018-01-31 08:38:30,107 WARN L491 AbstractCegarLoop]: Verification canceled [2018-01-31 08:38:30,112 WARN L185 ceAbstractionStarter]: Timeout [2018-01-31 08:38:30,112 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:38:30 BoogieIcfgContainer [2018-01-31 08:38:30,112 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:38:30,115 INFO L168 Benchmark]: Toolchain (without parser) took 125169.07 ms. Allocated memory was 308.8 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 269.8 MB in the beginning and 960.2 MB in the end (delta: -690.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 5.3 GB. [2018-01-31 08:38:30,116 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:38:30,116 INFO L168 Benchmark]: CACSL2BoogieTranslator took 241.51 ms. Allocated memory is still 308.8 MB. Free memory was 268.8 MB in the beginning and 260.6 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 5.3 GB. [2018-01-31 08:38:30,116 INFO L168 Benchmark]: Boogie Preprocessor took 45.85 ms. Allocated memory is still 308.8 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:38:30,117 INFO L168 Benchmark]: RCFGBuilder took 658.21 ms. Allocated memory is still 308.8 MB. Free memory was 258.6 MB in the beginning and 236.9 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 5.3 GB. [2018-01-31 08:38:30,117 INFO L168 Benchmark]: TraceAbstraction took 124198.98 ms. Allocated memory was 308.8 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 236.9 MB in the beginning and 960.2 MB in the end (delta: -723.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. [2018-01-31 08:38:30,119 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 308.8 MB. Free memory is still 274.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 241.51 ms. Allocated memory is still 308.8 MB. Free memory was 268.8 MB in the beginning and 260.6 MB in the end (delta: 8.3 MB). Peak memory consumption was 8.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 45.85 ms. Allocated memory is still 308.8 MB. Free memory was 260.6 MB in the beginning and 258.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 658.21 ms. Allocated memory is still 308.8 MB. Free memory was 258.6 MB in the beginning and 236.9 MB in the end (delta: 21.6 MB). Peak memory consumption was 21.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 124198.98 ms. Allocated memory was 308.8 MB in the beginning and 1.4 GB in the end (delta: 1.1 GB). Free memory was 236.9 MB in the beginning and 960.2 MB in the end (delta: -723.3 MB). Peak memory consumption was 1.0 GB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 14). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 441. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 14). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 441. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 441. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 441. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 441. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 23). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 441. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 37). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 441. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 34). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 441. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 37). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 441. - TimeoutResultAtElement [Line: 1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line 34). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 441. - TimeoutResultAtElement [Line: 31]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 31). Cancelled while BasicCegarLoop was analyzing trace of length 478 with TraceHistMax 21, while TraceCheckSpWp was constructing forward predicates, while PartialQuantifierElimination was eliminating quantifiers from formula with 0 quantifier alternations, while SimplifyDDAWithTimeout was simplifying term of DAG size 441. - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 89 locations, 11 error locations. TIMEOUT Result, 124.1s OverallTime, 36 OverallIterations, 21 TraceHistogramMax, 42.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2733 SDtfs, 7016 SDslu, 23052 SDs, 0 SdLazy, 19089 SolverSat, 1262 SolverUnsat, 108 SolverUnknown, 0 SolverNotchecked, 17.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 5859 GetRequests, 4582 SyntacticMatches, 59 SemanticMatches, 1218 ConstructedPredicates, 25 IntricatePredicates, 0 DeprecatedPredicates, 21336 ImplicationChecksByTransitivity, 43.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=471occurred in iteration=35, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.0s AutomataMinimizationTime, 35 MinimizatonAttempts, 554 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.6s SatisfiabilityAnalysisTime, 35.3s InterpolantComputationTime, 10064 NumberOfCodeBlocks, 10051 NumberOfCodeBlocksAsserted, 84 NumberOfCheckSat, 10005 ConstructedInterpolants, 1234 QuantifiedInterpolants, 15284095 SizeOfPredicates, 312 NumberOfNonLiveVariables, 11527 ConjunctsInSsa, 664 ConjunctsInUnsatCore, 59 InterpolantComputations, 13 PerfectInterpolantSequences, 23752/27294 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-38-30-130.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength2_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-38-30-130.csv Completed graceful shutdown