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_RubberTaipan+AI_EQ.epf -i ../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-24 13:20:43,176 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-24 13:20:43,200 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-24 13:20:43,214 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-24 13:20:43,214 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-24 13:20:43,215 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-24 13:20:43,216 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-24 13:20:43,218 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-24 13:20:43,219 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-24 13:20:43,220 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-24 13:20:43,221 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-24 13:20:43,221 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-24 13:20:43,222 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-24 13:20:43,223 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-24 13:20:43,224 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-24 13:20:43,227 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-24 13:20:43,229 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-24 13:20:43,231 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-24 13:20:43,232 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-24 13:20:43,233 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-24 13:20:43,235 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-24 13:20:43,235 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-24 13:20:43,235 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-24 13:20:43,236 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-24 13:20:43,237 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-24 13:20:43,238 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-24 13:20:43,239 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-24 13:20:43,239 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-24 13:20:43,239 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-24 13:20:43,240 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-24 13:20:43,240 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-24 13:20:43,241 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf [2018-01-24 13:20:43,250 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-24 13:20:43,250 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-24 13:20:43,251 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-24 13:20:43,251 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-24 13:20:43,252 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-24 13:20:43,252 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-24 13:20:43,252 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-24 13:20:43,253 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-24 13:20:43,253 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-24 13:20:43,253 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-24 13:20:43,253 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-24 13:20:43,253 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-24 13:20:43,253 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-24 13:20:43,254 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-24 13:20:43,254 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-24 13:20:43,254 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-24 13:20:43,254 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-24 13:20:43,254 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-24 13:20:43,255 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-24 13:20:43,255 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-24 13:20:43,255 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-24 13:20:43,255 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-24 13:20:43,255 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-24 13:20:43,255 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-24 13:20:43,256 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-24 13:20:43,256 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-24 13:20:43,256 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-24 13:20:43,256 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-24 13:20:43,256 INFO L133 SettingsManager]: * Trace refinement strategy=RUBBER_TAIPAN [2018-01-24 13:20:43,257 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-24 13:20:43,257 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-24 13:20:43,257 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-24 13:20:43,258 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-24 13:20:43,258 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-24 13:20:43,291 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-24 13:20:43,304 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-24 13:20:43,308 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-24 13:20:43,310 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-24 13:20:43,310 INFO L276 PluginConnector]: CDTParser initialized [2018-01-24 13:20:43,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-memsafety/ArraysOfVariableLength_true-valid-memsafety.c [2018-01-24 13:20:43,412 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-24 13:20:43,417 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-24 13:20:43,418 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-24 13:20:43,418 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-24 13:20:43,423 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-24 13:20:43,424 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:20:43" (1/1) ... [2018-01-24 13:20:43,427 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b758b6e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:43, skipping insertion in model container [2018-01-24 13:20:43,427 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.01 01:20:43" (1/1) ... [2018-01-24 13:20:43,440 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:20:43,454 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-24 13:20:43,565 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:20:43,581 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-24 13:20:43,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:43 WrapperNode [2018-01-24 13:20:43,588 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-24 13:20:43,588 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-24 13:20:43,588 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-24 13:20:43,588 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-24 13:20:43,598 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:43" (1/1) ... [2018-01-24 13:20:43,599 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:43" (1/1) ... [2018-01-24 13:20:43,607 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:43" (1/1) ... [2018-01-24 13:20:43,607 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:43" (1/1) ... [2018-01-24 13:20:43,611 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:43" (1/1) ... [2018-01-24 13:20:43,615 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:43" (1/1) ... [2018-01-24 13:20:43,616 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:43" (1/1) ... [2018-01-24 13:20:43,618 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-24 13:20:43,619 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-24 13:20:43,619 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-24 13:20:43,619 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-24 13:20:43,620 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:43" (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-24 13:20:43,665 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-24 13:20:43,665 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-24 13:20:43,665 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-01-24 13:20:43,665 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-24 13:20:43,666 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-24 13:20:43,666 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-24 13:20:43,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-24 13:20:43,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-24 13:20:43,666 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-24 13:20:43,666 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-01-24 13:20:43,666 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-24 13:20:43,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-24 13:20:43,666 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-24 13:20:43,858 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-24 13:20:43,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:20:43 BoogieIcfgContainer [2018-01-24 13:20:43,859 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-24 13:20:43,859 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-24 13:20:43,860 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-24 13:20:43,862 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-24 13:20:43,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.01 01:20:43" (1/3) ... [2018-01-24 13:20:43,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f79973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:20:43, skipping insertion in model container [2018-01-24 13:20:43,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.01 01:20:43" (2/3) ... [2018-01-24 13:20:43,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f79973 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.01 01:20:43, skipping insertion in model container [2018-01-24 13:20:43,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.01 01:20:43" (3/3) ... [2018-01-24 13:20:43,866 INFO L105 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength_true-valid-memsafety.c [2018-01-24 13:20:43,875 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-24 13:20:43,882 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-01-24 13:20:43,922 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-24 13:20:43,922 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-24 13:20:43,922 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-24 13:20:43,922 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-24 13:20:43,922 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-24 13:20:43,922 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-24 13:20:43,922 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-24 13:20:43,922 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-24 13:20:43,923 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-24 13:20:43,937 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states. [2018-01-24 13:20:43,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-01-24 13:20:43,944 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:43,945 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:43,946 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 13:20:43,951 INFO L82 PathProgramCache]: Analyzing trace with hash 1202729229, now seen corresponding path program 1 times [2018-01-24 13:20:43,954 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:44,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:44,003 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:44,003 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:44,003 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:44,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:44,037 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:44,067 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-24 13:20:44,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:20:44,069 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:20:44,069 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:44,072 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-01-24 13:20:44,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-01-24 13:20:44,084 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-01-24 13:20:44,086 INFO L87 Difference]: Start difference. First operand 49 states. Second operand 2 states. [2018-01-24 13:20:44,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:44,107 INFO L93 Difference]: Finished difference Result 90 states and 103 transitions. [2018-01-24 13:20:44,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-01-24 13:20:44,108 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 13 [2018-01-24 13:20:44,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:44,114 INFO L225 Difference]: With dead ends: 90 [2018-01-24 13:20:44,115 INFO L226 Difference]: Without dead ends: 46 [2018-01-24 13:20:44,118 INFO L525 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-24 13:20:44,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-01-24 13:20:44,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-01-24 13:20:44,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-01-24 13:20:44,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 49 transitions. [2018-01-24 13:20:44,149 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 49 transitions. Word has length 13 [2018-01-24 13:20:44,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:44,149 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 49 transitions. [2018-01-24 13:20:44,149 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-01-24 13:20:44,150 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 49 transitions. [2018-01-24 13:20:44,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-01-24 13:20:44,150 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:44,150 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:44,150 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 13:20:44,150 INFO L82 PathProgramCache]: Analyzing trace with hash -1812590093, now seen corresponding path program 1 times [2018-01-24 13:20:44,151 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:44,151 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:44,152 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:44,152 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:44,152 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:44,169 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:44,274 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-24 13:20:44,275 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:20:44,275 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:20:44,275 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:44,277 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:20:44,277 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:20:44,277 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:20:44,278 INFO L87 Difference]: Start difference. First operand 46 states and 49 transitions. Second operand 3 states. [2018-01-24 13:20:44,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:44,345 INFO L93 Difference]: Finished difference Result 83 states and 90 transitions. [2018-01-24 13:20:44,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:20:44,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-01-24 13:20:44,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:44,348 INFO L225 Difference]: With dead ends: 83 [2018-01-24 13:20:44,348 INFO L226 Difference]: Without dead ends: 67 [2018-01-24 13:20:44,350 INFO L525 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-24 13:20:44,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-01-24 13:20:44,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 50. [2018-01-24 13:20:44,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-24 13:20:44,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-24 13:20:44,362 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 14 [2018-01-24 13:20:44,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:44,363 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-24 13:20:44,363 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:20:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-24 13:20:44,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-24 13:20:44,364 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:44,364 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:44,364 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 13:20:44,364 INFO L82 PathProgramCache]: Analyzing trace with hash -267768884, now seen corresponding path program 1 times [2018-01-24 13:20:44,364 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:44,365 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:44,366 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:44,366 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:44,366 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:44,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:44,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:44,464 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-24 13:20:44,465 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:20:44,465 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:20:44,465 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:44,465 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:20:44,466 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:20:44,466 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:20:44,467 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 5 states. [2018-01-24 13:20:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:44,603 INFO L93 Difference]: Finished difference Result 113 states and 121 transitions. [2018-01-24 13:20:44,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:20:44,603 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-01-24 13:20:44,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:44,607 INFO L225 Difference]: With dead ends: 113 [2018-01-24 13:20:44,607 INFO L226 Difference]: Without dead ends: 73 [2018-01-24 13:20:44,608 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:20:44,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-01-24 13:20:44,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 57. [2018-01-24 13:20:44,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-01-24 13:20:44,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 60 transitions. [2018-01-24 13:20:44,617 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 60 transitions. Word has length 15 [2018-01-24 13:20:44,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:44,617 INFO L432 AbstractCegarLoop]: Abstraction has 57 states and 60 transitions. [2018-01-24 13:20:44,617 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:20:44,617 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 60 transitions. [2018-01-24 13:20:44,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:20:44,618 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:44,618 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:44,618 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 13:20:44,619 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181562, now seen corresponding path program 1 times [2018-01-24 13:20:44,619 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:44,620 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:44,620 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:44,621 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:44,621 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:44,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:44,634 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:44,659 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-24 13:20:44,659 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:20:44,659 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-01-24 13:20:44,659 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:44,660 INFO L409 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-01-24 13:20:44,660 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-01-24 13:20:44,660 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-01-24 13:20:44,661 INFO L87 Difference]: Start difference. First operand 57 states and 60 transitions. Second operand 3 states. [2018-01-24 13:20:44,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:44,695 INFO L93 Difference]: Finished difference Result 57 states and 60 transitions. [2018-01-24 13:20:44,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-01-24 13:20:44,696 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 19 [2018-01-24 13:20:44,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:44,699 INFO L225 Difference]: With dead ends: 57 [2018-01-24 13:20:44,699 INFO L226 Difference]: Without dead ends: 55 [2018-01-24 13:20:44,700 INFO L525 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-24 13:20:44,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-01-24 13:20:44,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-01-24 13:20:44,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-01-24 13:20:44,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 58 transitions. [2018-01-24 13:20:44,707 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 58 transitions. Word has length 19 [2018-01-24 13:20:44,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:44,707 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 58 transitions. [2018-01-24 13:20:44,708 INFO L433 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-01-24 13:20:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 58 transitions. [2018-01-24 13:20:44,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-01-24 13:20:44,708 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:44,709 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:44,709 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 13:20:44,709 INFO L82 PathProgramCache]: Analyzing trace with hash 1098181563, now seen corresponding path program 1 times [2018-01-24 13:20:44,709 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:44,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:44,710 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:44,710 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:44,710 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:44,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:44,722 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:44,803 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-24 13:20:44,804 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:20:44,804 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-24 13:20:44,804 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:44,804 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-24 13:20:44,805 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-24 13:20:44,805 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:20:44,805 INFO L87 Difference]: Start difference. First operand 55 states and 58 transitions. Second operand 4 states. [2018-01-24 13:20:44,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:44,884 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2018-01-24 13:20:44,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:20:44,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-01-24 13:20:44,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:44,886 INFO L225 Difference]: With dead ends: 67 [2018-01-24 13:20:44,886 INFO L226 Difference]: Without dead ends: 65 [2018-01-24 13:20:44,886 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-24 13:20:44,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-24 13:20:44,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 58. [2018-01-24 13:20:44,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 13:20:44,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 61 transitions. [2018-01-24 13:20:44,894 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 61 transitions. Word has length 19 [2018-01-24 13:20:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:44,894 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 61 transitions. [2018-01-24 13:20:44,895 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-24 13:20:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 61 transitions. [2018-01-24 13:20:44,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-01-24 13:20:44,896 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:44,896 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:44,896 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 13:20:44,896 INFO L82 PathProgramCache]: Analyzing trace with hash -2060273317, now seen corresponding path program 1 times [2018-01-24 13:20:44,896 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:44,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:44,897 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:44,897 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:44,898 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:44,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:44,914 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:44,966 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:20:44,966 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:20:44,966 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:20:44,966 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:44,967 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:20:44,967 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:20:44,967 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:20:44,967 INFO L87 Difference]: Start difference. First operand 58 states and 61 transitions. Second operand 5 states. [2018-01-24 13:20:45,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:45,047 INFO L93 Difference]: Finished difference Result 70 states and 74 transitions. [2018-01-24 13:20:45,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:20:45,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2018-01-24 13:20:45,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:45,049 INFO L225 Difference]: With dead ends: 70 [2018-01-24 13:20:45,049 INFO L226 Difference]: Without dead ends: 69 [2018-01-24 13:20:45,049 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:20:45,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-24 13:20:45,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 61. [2018-01-24 13:20:45,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 13:20:45,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-24 13:20:45,058 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 28 [2018-01-24 13:20:45,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:45,058 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-24 13:20:45,058 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:20:45,059 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-24 13:20:45,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 13:20:45,060 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:45,060 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:45,060 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 13:20:45,060 INFO L82 PathProgramCache]: Analyzing trace with hash 556036660, now seen corresponding path program 1 times [2018-01-24 13:20:45,060 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:45,061 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:45,062 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:45,062 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:45,062 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:45,080 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:45,247 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:45,247 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:45,247 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 13:20:45,260 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:45,261 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:45,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:45,301 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:45,342 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-24 13:20:45,344 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:45,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:20:45,348 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:20:45,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:20:45,414 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:45,487 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-01-24 13:20:45,509 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:20:45,509 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [7] total 12 [2018-01-24 13:20:45,509 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:45,510 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:20:45,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:20:45,510 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:20:45,510 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 6 states. [2018-01-24 13:20:45,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:45,625 INFO L93 Difference]: Finished difference Result 69 states and 73 transitions. [2018-01-24 13:20:45,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:20:45,627 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2018-01-24 13:20:45,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:45,628 INFO L225 Difference]: With dead ends: 69 [2018-01-24 13:20:45,628 INFO L226 Difference]: Without dead ends: 68 [2018-01-24 13:20:45,628 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:20:45,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-01-24 13:20:45,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 62. [2018-01-24 13:20:45,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-24 13:20:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-01-24 13:20:45,636 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 29 [2018-01-24 13:20:45,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:45,637 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-01-24 13:20:45,637 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:20:45,637 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-01-24 13:20:45,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-01-24 13:20:45,638 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:45,638 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:45,638 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 13:20:45,638 INFO L82 PathProgramCache]: Analyzing trace with hash 556036659, now seen corresponding path program 1 times [2018-01-24 13:20:45,638 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:45,639 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:45,640 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:45,640 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:45,640 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:45,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:45,652 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:45,720 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:45,720 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:20:45,721 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-24 13:20:45,721 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:45,721 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:20:45,721 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:20:45,722 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-24 13:20:45,722 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 5 states. [2018-01-24 13:20:45,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:45,763 INFO L93 Difference]: Finished difference Result 62 states and 67 transitions. [2018-01-24 13:20:45,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-24 13:20:45,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-01-24 13:20:45,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:45,764 INFO L225 Difference]: With dead ends: 62 [2018-01-24 13:20:45,764 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 13:20:45,764 INFO L525 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-24 13:20:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 13:20:45,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-01-24 13:20:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-01-24 13:20:45,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2018-01-24 13:20:45,770 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 29 [2018-01-24 13:20:45,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:45,770 INFO L432 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2018-01-24 13:20:45,770 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:20:45,771 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2018-01-24 13:20:45,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 13:20:45,771 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:45,771 INFO L322 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] [2018-01-24 13:20:45,771 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 13:20:45,772 INFO L82 PathProgramCache]: Analyzing trace with hash -848422454, now seen corresponding path program 1 times [2018-01-24 13:20:45,772 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:45,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:45,772 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:45,772 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:45,773 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:45,782 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:45,968 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:20:45,969 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-24 13:20:45,969 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-24 13:20:45,969 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:45,969 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:20:45,970 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:20:45,970 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:20:45,970 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand 6 states. [2018-01-24 13:20:46,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:46,048 INFO L93 Difference]: Finished difference Result 68 states and 73 transitions. [2018-01-24 13:20:46,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:20:46,049 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-01-24 13:20:46,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:46,050 INFO L225 Difference]: With dead ends: 68 [2018-01-24 13:20:46,050 INFO L226 Difference]: Without dead ends: 66 [2018-01-24 13:20:46,050 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-01-24 13:20:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-01-24 13:20:46,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 56. [2018-01-24 13:20:46,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-24 13:20:46,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-24 13:20:46,059 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 32 [2018-01-24 13:20:46,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:46,060 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-24 13:20:46,060 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:20:46,060 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-24 13:20:46,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-01-24 13:20:46,061 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:46,062 INFO L322 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] [2018-01-24 13:20:46,062 INFO L371 AbstractCegarLoop]: === Iteration 10 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 13:20:46,062 INFO L82 PathProgramCache]: Analyzing trace with hash -1529051221, now seen corresponding path program 1 times [2018-01-24 13:20:46,062 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:46,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:46,063 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:46,063 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:46,064 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:46,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:46,075 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:46,127 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-24 13:20:46,127 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:46,127 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 13:20:46,147 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:46,147 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:46,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:46,178 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:46,238 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-24 13:20:46,238 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:46,307 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-24 13:20:46,328 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:46,328 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:20:46,332 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:46,332 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:46,362 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:46,366 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-24 13:20:46,367 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:46,382 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-24 13:20:46,384 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:20:46,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4, 4, 4] total 7 [2018-01-24 13:20:46,384 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:20:46,384 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-24 13:20:46,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-24 13:20:46,385 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:20:46,385 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 5 states. [2018-01-24 13:20:46,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:46,554 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2018-01-24 13:20:46,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-24 13:20:46,555 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2018-01-24 13:20:46,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:46,556 INFO L225 Difference]: With dead ends: 101 [2018-01-24 13:20:46,556 INFO L226 Difference]: Without dead ends: 85 [2018-01-24 13:20:46,556 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-01-24 13:20:46,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-01-24 13:20:46,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 67. [2018-01-24 13:20:46,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-01-24 13:20:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 72 transitions. [2018-01-24 13:20:46,564 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 72 transitions. Word has length 32 [2018-01-24 13:20:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:46,564 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 72 transitions. [2018-01-24 13:20:46,565 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-24 13:20:46,565 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 72 transitions. [2018-01-24 13:20:46,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-24 13:20:46,566 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:46,566 INFO L322 BasicCegarLoop]: trace histogram [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] [2018-01-24 13:20:46,566 INFO L371 AbstractCegarLoop]: === Iteration 11 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 13:20:46,566 INFO L82 PathProgramCache]: Analyzing trace with hash -736270445, now seen corresponding path program 1 times [2018-01-24 13:20:46,566 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:46,567 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:46,567 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:46,568 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:46,568 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:46,578 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:46,660 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:46,660 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:46,660 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 13:20:46,665 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:46,665 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:46,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:46,686 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:46,772 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:46,772 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:46,829 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:46,850 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:46,850 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:20:46,853 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:46,854 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:46,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:46,891 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:46,900 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:46,900 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:46,947 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-24 13:20:46,949 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:20:46,949 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7, 7, 7] total 14 [2018-01-24 13:20:46,949 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:20:46,950 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-24 13:20:46,950 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-24 13:20:46,950 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-01-24 13:20:46,951 INFO L87 Difference]: Start difference. First operand 67 states and 72 transitions. Second operand 14 states. [2018-01-24 13:20:47,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:47,288 INFO L93 Difference]: Finished difference Result 144 states and 156 transitions. [2018-01-24 13:20:47,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-24 13:20:47,289 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 34 [2018-01-24 13:20:47,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:47,290 INFO L225 Difference]: With dead ends: 144 [2018-01-24 13:20:47,290 INFO L226 Difference]: Without dead ends: 100 [2018-01-24 13:20:47,291 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 125 SyntacticMatches, 8 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=65, Invalid=207, Unknown=0, NotChecked=0, Total=272 [2018-01-24 13:20:47,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-01-24 13:20:47,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 80. [2018-01-24 13:20:47,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-01-24 13:20:47,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2018-01-24 13:20:47,299 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 34 [2018-01-24 13:20:47,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:47,300 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2018-01-24 13:20:47,300 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-24 13:20:47,300 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2018-01-24 13:20:47,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-24 13:20:47,301 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:47,301 INFO L322 BasicCegarLoop]: trace histogram [3, 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] [2018-01-24 13:20:47,301 INFO L371 AbstractCegarLoop]: === Iteration 12 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 13:20:47,301 INFO L82 PathProgramCache]: Analyzing trace with hash 733800956, now seen corresponding path program 2 times [2018-01-24 13:20:47,302 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:47,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:47,302 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:47,302 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:47,302 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:47,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:47,312 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:47,346 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-01-24 13:20:47,346 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:47,347 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 13:20:47,360 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:20:47,360 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:20:47,373 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:20:47,375 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:20:47,378 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:47,403 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:20:47,406 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 12 treesize of output 5 [2018-01-24 13:20:47,406 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:47,408 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-24 13:20:47,408 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 13:20:47,454 INFO L700 Elim1Store]: detected not equals via solver [2018-01-24 13:20:47,454 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 12 treesize of output 5 [2018-01-24 13:20:47,455 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:47,456 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-24 13:20:47,456 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:12, output treesize:5 [2018-01-24 13:20:47,473 WARN L1029 $PredicateComparison]: unable to prove that (exists ((|main_~#b~3.base| Int)) (and (= (store |c_old(#valid)| |main_~#b~3.base| 0) |c_#valid|) (= 0 (select |c_old(#valid)| |main_~#b~3.base|)))) is different from true [2018-01-24 13:20:47,478 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-24 13:20:47,478 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:47,493 WARN L1007 $PredicateComparison]: unable to prove that (forall ((|v_main_~#b~3.base_18| Int)) (or (= |c_old(#valid)| (store |c_#valid| |v_main_~#b~3.base_18| 0)) (not (= 0 (select |c_#valid| |v_main_~#b~3.base_18|))))) is different from false [2018-01-24 13:20:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-01-24 13:20:47,522 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:20:47,522 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5, 4] imperfect sequences [5] total 11 [2018-01-24 13:20:47,522 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:47,522 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:20:47,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:20:47,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=54, Unknown=2, NotChecked=30, Total=110 [2018-01-24 13:20:47,523 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand 6 states. [2018-01-24 13:20:47,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:47,578 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2018-01-24 13:20:47,578 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:20:47,578 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-01-24 13:20:47,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:47,579 INFO L225 Difference]: With dead ends: 81 [2018-01-24 13:20:47,579 INFO L226 Difference]: Without dead ends: 59 [2018-01-24 13:20:47,580 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 82 SyntacticMatches, 3 SemanticMatches, 11 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=85, Unknown=2, NotChecked=38, Total=156 [2018-01-24 13:20:47,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-01-24 13:20:47,588 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-01-24 13:20:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 13:20:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 62 transitions. [2018-01-24 13:20:47,588 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 62 transitions. Word has length 45 [2018-01-24 13:20:47,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:47,589 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 62 transitions. [2018-01-24 13:20:47,589 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:20:47,589 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2018-01-24 13:20:47,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-01-24 13:20:47,590 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:47,590 INFO L322 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:47,590 INFO L371 AbstractCegarLoop]: === Iteration 13 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 13:20:47,590 INFO L82 PathProgramCache]: Analyzing trace with hash 611219876, now seen corresponding path program 2 times [2018-01-24 13:20:47,590 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:47,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:47,591 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 13:20:47,591 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:47,591 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:47,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:47,603 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:47,713 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 22 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 13:20:47,714 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:47,714 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 13:20:47,722 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-24 13:20:47,722 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST1 (IT: FPandBP) [2018-01-24 13:20:47,733 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:20:47,750 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-24 13:20:47,752 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:20:47,755 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:47,802 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 13:20:47,802 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:47,858 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-24 13:20:47,892 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-24 13:20:47,892 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [12] total 16 [2018-01-24 13:20:47,892 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-24 13:20:47,892 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-24 13:20:47,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-24 13:20:47,893 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-01-24 13:20:47,893 INFO L87 Difference]: Start difference. First operand 59 states and 62 transitions. Second operand 6 states. [2018-01-24 13:20:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:47,935 INFO L93 Difference]: Finished difference Result 90 states and 95 transitions. [2018-01-24 13:20:47,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-24 13:20:47,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 47 [2018-01-24 13:20:47,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:47,936 INFO L225 Difference]: With dead ends: 90 [2018-01-24 13:20:47,936 INFO L226 Difference]: Without dead ends: 61 [2018-01-24 13:20:47,937 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 87 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-01-24 13:20:47,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-01-24 13:20:47,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2018-01-24 13:20:47,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-01-24 13:20:47,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-01-24 13:20:47,945 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 47 [2018-01-24 13:20:47,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:47,946 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-01-24 13:20:47,946 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-24 13:20:47,946 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-01-24 13:20:47,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-24 13:20:47,947 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:47,947 INFO L322 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:47,947 INFO L371 AbstractCegarLoop]: === Iteration 14 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 13:20:47,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1268780948, now seen corresponding path program 3 times [2018-01-24 13:20:47,947 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:47,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:47,948 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 13:20:47,948 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:47,949 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:47,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:47,963 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:48,052 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 13:20:48,052 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:48,052 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 13:20:48,061 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 13:20:48,062 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 13:20:48,078 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:20:48,084 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:20:48,094 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:20:48,097 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:48,122 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 13:20:48,122 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:48,210 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 13:20:48,276 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:48,277 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:20:48,280 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-24 13:20:48,280 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-01-24 13:20:48,293 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:20:48,310 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-24 13:20:48,324 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-24 13:20:48,330 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:48,338 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 21 proven. 1 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 13:20:48,339 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:48,357 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 3 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 13:20:48,360 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:20:48,360 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5, 5, 5] total 12 [2018-01-24 13:20:48,360 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:20:48,360 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-01-24 13:20:48,361 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-01-24 13:20:48,361 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2018-01-24 13:20:48,361 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 9 states. [2018-01-24 13:20:48,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:48,473 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-01-24 13:20:48,473 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-24 13:20:48,473 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-01-24 13:20:48,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:48,474 INFO L225 Difference]: With dead ends: 61 [2018-01-24 13:20:48,474 INFO L226 Difference]: Without dead ends: 60 [2018-01-24 13:20:48,475 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 207 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-01-24 13:20:48,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-01-24 13:20:48,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 58. [2018-01-24 13:20:48,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-24 13:20:48,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 59 transitions. [2018-01-24 13:20:48,480 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 59 transitions. Word has length 53 [2018-01-24 13:20:48,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:48,481 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 59 transitions. [2018-01-24 13:20:48,481 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-01-24 13:20:48,481 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 59 transitions. [2018-01-24 13:20:48,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-01-24 13:20:48,482 INFO L314 BasicCegarLoop]: Found error trace [2018-01-24 13:20:48,482 INFO L322 BasicCegarLoop]: trace histogram [5, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-24 13:20:48,482 INFO L371 AbstractCegarLoop]: === Iteration 15 === [fooErr1RequiresViolation, fooErr0AssertViolation, fooErr2RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation]=== [2018-01-24 13:20:48,482 INFO L82 PathProgramCache]: Analyzing trace with hash -677503677, now seen corresponding path program 1 times [2018-01-24 13:20:48,482 INFO L67 tionRefinementEngine]: Using refinement strategy RubberTaipanRefinementStrategy [2018-01-24 13:20:48,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:48,483 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-24 13:20:48,483 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-24 13:20:48,483 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-24 13:20:48,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:48,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-24 13:20:48,653 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 2 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-01-24 13:20:48,654 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:48,654 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG 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-24 13:20:48,659 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:48,659 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:48,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:48,676 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:48,679 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-24 13:20:48,680 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:48,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:20:48,682 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:20:48,753 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 13:20:48,753 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:48,851 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 13:20:48,871 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-24 13:20:48,872 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-24 13:20:48,877 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-24 13:20:48,878 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-24 13:20:48,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-24 13:20:48,912 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-24 13:20:48,915 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-24 13:20:48,915 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-24 13:20:48,918 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-24 13:20:48,919 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-01-24 13:20:48,951 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 13:20:48,952 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-24 13:20:48,969 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 20 proven. 4 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2018-01-24 13:20:48,971 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-24 13:20:48,971 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 5, 6, 5] total 16 [2018-01-24 13:20:48,971 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-24 13:20:48,971 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-24 13:20:48,972 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-24 13:20:48,972 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=215, Unknown=0, NotChecked=0, Total=272 [2018-01-24 13:20:48,972 INFO L87 Difference]: Start difference. First operand 58 states and 59 transitions. Second operand 13 states. [2018-01-24 13:20:49,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-24 13:20:49,108 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2018-01-24 13:20:49,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-24 13:20:49,109 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 54 [2018-01-24 13:20:49,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-24 13:20:49,109 INFO L225 Difference]: With dead ends: 74 [2018-01-24 13:20:49,110 INFO L226 Difference]: Without dead ends: 0 [2018-01-24 13:20:49,110 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 198 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=315, Unknown=0, NotChecked=0, Total=420 [2018-01-24 13:20:49,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-24 13:20:49,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-24 13:20:49,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-24 13:20:49,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-24 13:20:49,111 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 54 [2018-01-24 13:20:49,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-24 13:20:49,111 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-24 13:20:49,112 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-24 13:20:49,112 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-24 13:20:49,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-24 13:20:49,117 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-24 13:20:49,139 WARN L137 erpolLogProxyWrapper]: Already inconsistent. [2018-01-24 13:20:49,598 WARN L146 SmtUtils]: Spent 210ms on a formula simplification. DAG size of input: 70 DAG size of output 53 [2018-01-24 13:20:49,624 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 31) no Hoare annotation was computed. [2018-01-24 13:20:49,624 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 31) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 13:20:49,624 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 31) no Hoare annotation was computed. [2018-01-24 13:20:49,624 INFO L401 ceAbstractionStarter]: For program point fooFINAL(lines 12 18) no Hoare annotation was computed. [2018-01-24 13:20:49,624 INFO L397 ceAbstractionStarter]: At program point L14'''(lines 14 16) the Hoare annotation is: (let ((.cse0 (not (= 0 |foo_#in~b.offset|))) (.cse1 (not (= (select |#valid| |foo_#in~b.base|) 1))) (.cse4 (not (= 400 (select |#length| |foo_#in~b.base|)))) (.cse3 (= foo_~i~1 0)) (.cse5 (< |foo_#in~n| |foo_#in~size|))) (and (let ((.cse2 (<= foo_~size 1))) (or .cse0 .cse1 (and .cse2 .cse3) .cse4 (< 1 |foo_#in~size|) (and .cse2 (= 1 foo_~i~1)) .cse5)) (or .cse0 .cse1 (not (= 0 |foo_#in~size|)) .cse4 (and (= foo_~size 0) .cse3) .cse5) (let ((.cse6 (<= foo_~size 99)) (.cse7 (= 1 (select |#valid| foo_~b.base))) (.cse8 (= (select |#length| foo_~b.base) 400)) (.cse9 (= foo_~b.offset 0)) (.cse10 (<= foo_~size foo_~n))) (or .cse0 (< 99 |foo_#in~size|) .cse1 (and .cse6 .cse7 .cse8 .cse9 (<= 1 foo_~i~1) .cse10) .cse4 (and .cse6 (<= |foo_#in~size| foo_~size) .cse7 .cse8 .cse9 .cse10 .cse3) .cse5)))) [2018-01-24 13:20:49,625 INFO L401 ceAbstractionStarter]: For program point fooEXIT(lines 12 18) no Hoare annotation was computed. [2018-01-24 13:20:49,625 INFO L401 ceAbstractionStarter]: For program point L14''(lines 14 16) no Hoare annotation was computed. [2018-01-24 13:20:49,625 INFO L401 ceAbstractionStarter]: For program point L14''''(lines 14 16) no Hoare annotation was computed. [2018-01-24 13:20:49,625 INFO L404 ceAbstractionStarter]: At program point fooENTRY(lines 12 18) the Hoare annotation is: true [2018-01-24 13:20:49,625 INFO L401 ceAbstractionStarter]: For program point fooErr2RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 13:20:49,625 INFO L401 ceAbstractionStarter]: For program point L14(lines 14 16) no Hoare annotation was computed. [2018-01-24 13:20:49,625 INFO L401 ceAbstractionStarter]: For program point L15(line 15) no Hoare annotation was computed. [2018-01-24 13:20:49,625 INFO L401 ceAbstractionStarter]: For program point fooErr1RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 13:20:49,625 INFO L401 ceAbstractionStarter]: For program point L15'(line 15) no Hoare annotation was computed. [2018-01-24 13:20:49,625 INFO L401 ceAbstractionStarter]: For program point L15''(line 15) no Hoare annotation was computed. [2018-01-24 13:20:49,625 INFO L401 ceAbstractionStarter]: For program point fooErr0AssertViolation(line 15) no Hoare annotation was computed. [2018-01-24 13:20:49,625 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 31) the Hoare annotation is: true [2018-01-24 13:20:49,625 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 31) no Hoare annotation was computed. [2018-01-24 13:20:49,625 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 31) the Hoare annotation is: true [2018-01-24 13:20:49,626 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 31) no Hoare annotation was computed. [2018-01-24 13:20:49,626 INFO L401 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 13:20:49,626 INFO L401 ceAbstractionStarter]: For program point L21(line 21) no Hoare annotation was computed. [2018-01-24 13:20:49,626 INFO L397 ceAbstractionStarter]: At program point L23(line 23) the Hoare annotation is: (and (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1)) (= 0 |main_~#b~3.offset|) (= (select |#length| |main_~#b~3.base|) 400) (= 0 (select |old(#valid)| |main_~#b~3.base|)) (<= main_~i~3 99) (<= 0 (+ (* 4 main_~i~3) |main_~#b~3.offset|))) [2018-01-24 13:20:49,626 INFO L401 ceAbstractionStarter]: For program point L22(lines 22 24) no Hoare annotation was computed. [2018-01-24 13:20:49,626 INFO L401 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 13:20:49,626 INFO L401 ceAbstractionStarter]: For program point L25(lines 25 29) no Hoare annotation was computed. [2018-01-24 13:20:49,626 INFO L401 ceAbstractionStarter]: For program point L27(line 27) no Hoare annotation was computed. [2018-01-24 13:20:49,626 INFO L401 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-01-24 13:20:49,626 INFO L401 ceAbstractionStarter]: For program point L23'''(line 23) no Hoare annotation was computed. [2018-01-24 13:20:49,626 INFO L401 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 13:20:49,626 INFO L401 ceAbstractionStarter]: For program point L23'(line 23) no Hoare annotation was computed. [2018-01-24 13:20:49,627 INFO L401 ceAbstractionStarter]: For program point L21'''''(line 21) no Hoare annotation was computed. [2018-01-24 13:20:49,627 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 20 31) no Hoare annotation was computed. [2018-01-24 13:20:49,627 INFO L401 ceAbstractionStarter]: For program point L22''(lines 22 24) no Hoare annotation was computed. [2018-01-24 13:20:49,627 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 20 31) no Hoare annotation was computed. [2018-01-24 13:20:49,627 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 20 31) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-24 13:20:49,627 INFO L401 ceAbstractionStarter]: For program point L22''''(lines 22 24) no Hoare annotation was computed. [2018-01-24 13:20:49,627 INFO L397 ceAbstractionStarter]: At program point L22'''(lines 22 24) the Hoare annotation is: (and (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1)) (= 0 |main_~#b~3.offset|) (= (select |#length| |main_~#b~3.base|) 400) (= 0 (select |old(#valid)| |main_~#b~3.base|)) (<= 0 (+ (* 4 main_~i~3) |main_~#b~3.offset|))) [2018-01-24 13:20:49,627 INFO L401 ceAbstractionStarter]: For program point L26'(line 26) no Hoare annotation was computed. [2018-01-24 13:20:49,627 INFO L401 ceAbstractionStarter]: For program point L21''''(line 21) no Hoare annotation was computed. [2018-01-24 13:20:49,628 INFO L397 ceAbstractionStarter]: At program point L25'''(lines 25 29) the Hoare annotation is: (and (= |#valid| (store |old(#valid)| |main_~#b~3.base| 1)) (= 0 |main_~#b~3.offset|) (= (select |#length| |main_~#b~3.base|) 400) (= 0 (select |old(#valid)| |main_~#b~3.base|)) (<= 0 (+ (* 4 main_~i~3) |main_~#b~3.offset|))) [2018-01-24 13:20:49,628 INFO L401 ceAbstractionStarter]: For program point L21'''(line 21) no Hoare annotation was computed. [2018-01-24 13:20:49,628 INFO L401 ceAbstractionStarter]: For program point L21'(line 21) no Hoare annotation was computed. [2018-01-24 13:20:49,628 INFO L401 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 31) no Hoare annotation was computed. [2018-01-24 13:20:49,628 INFO L401 ceAbstractionStarter]: For program point L25''''(lines 25 29) no Hoare annotation was computed. [2018-01-24 13:20:49,628 INFO L401 ceAbstractionStarter]: For program point L25''(lines 25 29) no Hoare annotation was computed. [2018-01-24 13:20:49,628 INFO L401 ceAbstractionStarter]: For program point L23''(line 23) no Hoare annotation was computed. [2018-01-24 13:20:49,628 INFO L401 ceAbstractionStarter]: For program point mainErr4EnsuresViolation(lines 20 31) no Hoare annotation was computed. [2018-01-24 13:20:49,628 INFO L401 ceAbstractionStarter]: For program point L21''(line 21) no Hoare annotation was computed. [2018-01-24 13:20:49,635 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,638 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,641 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,642 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,646 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,647 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,648 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,649 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,650 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,652 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.01 01:20:49 BoogieIcfgContainer [2018-01-24 13:20:49,652 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-24 13:20:49,653 INFO L168 Benchmark]: Toolchain (without parser) took 6240.36 ms. Allocated memory was 299.9 MB in the beginning and 539.5 MB in the end (delta: 239.6 MB). Free memory was 261.0 MB in the beginning and 366.0 MB in the end (delta: -105.0 MB). Peak memory consumption was 134.6 MB. Max. memory is 5.3 GB. [2018-01-24 13:20:49,655 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 299.9 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-24 13:20:49,655 INFO L168 Benchmark]: CACSL2BoogieTranslator took 169.96 ms. Allocated memory is still 299.9 MB. Free memory was 261.0 MB in the beginning and 251.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 5.3 GB. [2018-01-24 13:20:49,656 INFO L168 Benchmark]: Boogie Preprocessor took 30.32 ms. Allocated memory is still 299.9 MB. Free memory was 251.9 MB in the beginning and 250.9 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. [2018-01-24 13:20:49,656 INFO L168 Benchmark]: RCFGBuilder took 239.65 ms. Allocated memory is still 299.9 MB. Free memory was 250.9 MB in the beginning and 234.2 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. [2018-01-24 13:20:49,656 INFO L168 Benchmark]: TraceAbstraction took 5792.80 ms. Allocated memory was 299.9 MB in the beginning and 539.5 MB in the end (delta: 239.6 MB). Free memory was 234.2 MB in the beginning and 366.0 MB in the end (delta: -131.8 MB). Peak memory consumption was 107.8 MB. Max. memory is 5.3 GB. [2018-01-24 13:20:49,658 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.18 ms. Allocated memory is still 299.9 MB. Free memory is still 265.9 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 169.96 ms. Allocated memory is still 299.9 MB. Free memory was 261.0 MB in the beginning and 251.9 MB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 30.32 ms. Allocated memory is still 299.9 MB. Free memory was 251.9 MB in the beginning and 250.9 MB in the end (delta: 996.3 kB). Peak memory consumption was 996.3 kB. Max. memory is 5.3 GB. * RCFGBuilder took 239.65 ms. Allocated memory is still 299.9 MB. Free memory was 250.9 MB in the beginning and 234.2 MB in the end (delta: 16.7 MB). Peak memory consumption was 16.7 MB. Max. memory is 5.3 GB. * TraceAbstraction took 5792.80 ms. Allocated memory was 299.9 MB in the beginning and 539.5 MB in the end (delta: 239.6 MB). Free memory was 234.2 MB in the beginning and 366.0 MB in the end (delta: -131.8 MB). Peak memory consumption was 107.8 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 15]: array index is always in bounds For all program executions holds that array index is always in bounds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 20]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 22]: Loop Invariant [2018-01-24 13:20:49,663 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,664 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((\valid == \old(\valid)[b := 1] && 0 == b) && unknown-#length-unknown[b] == 400) && 0 == \old(\valid)[b]) && 0 <= 4 * i + b - InvariantResult [Line: 14]: Loop Invariant [2018-01-24 13:20:49,666 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,667 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,667 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,667 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,667 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,670 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,670 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,670 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,670 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,670 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((!(0 == b) || !(\valid[b] == 1)) || (size <= 1 && i == 0)) || !(400 == unknown-#length-unknown[b])) || 1 < \old(size)) || (size <= 1 && 1 == i)) || \old(n) < \old(size)) && (((((!(0 == b) || !(\valid[b] == 1)) || !(0 == \old(size))) || !(400 == unknown-#length-unknown[b])) || (size == 0 && i == 0)) || \old(n) < \old(size))) && ((((((!(0 == b) || 99 < \old(size)) || !(\valid[b] == 1)) || (((((size <= 99 && 1 == \valid[b]) && unknown-#length-unknown[b] == 400) && b == 0) && 1 <= i) && size <= n)) || !(400 == unknown-#length-unknown[b])) || ((((((size <= 99 && \old(size) <= size) && 1 == \valid[b]) && unknown-#length-unknown[b] == 400) && b == 0) && size <= n) && i == 0)) || \old(n) < \old(size)) - InvariantResult [Line: 25]: Loop Invariant [2018-01-24 13:20:49,671 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-24 13:20:49,672 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((\valid == \old(\valid)[b := 1] && 0 == b) && unknown-#length-unknown[b] == 400) && 0 == \old(\valid)[b]) && 0 <= 4 * i + b - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 49 locations, 8 error locations. SAFE Result, 5.7s OverallTime, 15 OverallIterations, 5 TraceHistogramMax, 1.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 515 SDtfs, 689 SDslu, 881 SDs, 0 SdLazy, 702 SolverSat, 90 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1025 GetRequests, 885 SyntacticMatches, 28 SemanticMatches, 112 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 376 ImplicationChecksByTransitivity, 1.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=80occurred in iteration=11, 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, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 106 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 21 PreInvPairs, 36 NumberOfFragments, 239 HoareAnnotationTreeSize, 21 FomulaSimplifications, 299 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 804 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 930 NumberOfCodeBlocks, 866 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1360 ConstructedInterpolants, 58 QuantifiedInterpolants, 251604 SizeOfPredicates, 29 NumberOfNonLiveVariables, 1279 ConjunctsInSsa, 94 ConjunctsInUnsatCore, 37 InterpolantComputations, 14 PerfectInterpolantSequences, 637/713 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-24_13-20-49-678.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/ArraysOfVariableLength_true-valid-memsafety.c_svcomp-DerefFreeMemtrack-32bit-Automizer_RubberTaipan+AI_EQ.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-24_13-20-49-678.csv Received shutdown request...