java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-5f7ec6e [2018-01-31 08:18:45,777 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-31 08:18:45,779 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-31 08:18:45,802 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-31 08:18:45,802 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-31 08:18:45,803 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-31 08:18:45,806 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-31 08:18:45,808 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-31 08:18:45,811 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-31 08:18:45,812 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-31 08:18:45,813 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-31 08:18:45,813 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-31 08:18:45,814 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-31 08:18:45,818 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-31 08:18:45,819 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-31 08:18:45,821 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-31 08:18:45,831 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-31 08:18:45,833 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-31 08:18:45,834 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-31 08:18:45,835 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-31 08:18:45,840 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-31 08:18:45,841 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-31 08:18:45,841 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-31 08:18:45,842 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-31 08:18:45,844 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-31 08:18:45,846 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-31 08:18:45,846 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-31 08:18:45,846 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-31 08:18:45,846 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-31 08:18:45,847 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-31 08:18:45,847 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-31 08:18:45,847 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-31 08:18:45,861 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-31 08:18:45,861 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-31 08:18:45,863 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-31 08:18:45,863 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-31 08:18:45,864 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-31 08:18:45,864 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-31 08:18:45,864 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-31 08:18:45,865 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-31 08:18:45,865 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-31 08:18:45,865 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-31 08:18:45,865 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-31 08:18:45,865 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-31 08:18:45,866 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-31 08:18:45,866 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-31 08:18:45,866 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-31 08:18:45,866 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-31 08:18:45,866 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-31 08:18:45,866 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-31 08:18:45,867 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-31 08:18:45,867 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-31 08:18:45,867 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-31 08:18:45,868 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-31 08:18:45,868 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-31 08:18:45,868 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:18:45,868 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-31 08:18:45,868 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-31 08:18:45,868 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-31 08:18:45,869 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-31 08:18:45,869 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-31 08:18:45,869 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-31 08:18:45,869 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-31 08:18:45,869 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-31 08:18:45,870 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-31 08:18:45,870 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-31 08:18:45,922 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-31 08:18:45,936 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-31 08:18:45,939 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-31 08:18:45,941 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-31 08:18:45,941 INFO L276 PluginConnector]: CDTParser initialized [2018-01-31 08:18:45,942 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/count_down-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:18:46,114 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-31 08:18:46,125 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-31 08:18:46,128 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-31 08:18:46,128 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-31 08:18:46,134 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-31 08:18:46,135 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:18:46" (1/1) ... [2018-01-31 08:18:46,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eff6b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:46, skipping insertion in model container [2018-01-31 08:18:46,141 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.01 08:18:46" (1/1) ... [2018-01-31 08:18:46,159 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:18:46,216 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-31 08:18:46,395 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:18:46,425 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-31 08:18:46,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:46 WrapperNode [2018-01-31 08:18:46,435 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-31 08:18:46,436 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-31 08:18:46,436 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-31 08:18:46,436 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-31 08:18:46,452 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:46" (1/1) ... [2018-01-31 08:18:46,452 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:46" (1/1) ... [2018-01-31 08:18:46,464 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:46" (1/1) ... [2018-01-31 08:18:46,464 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:46" (1/1) ... [2018-01-31 08:18:46,469 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:46" (1/1) ... [2018-01-31 08:18:46,473 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:46" (1/1) ... [2018-01-31 08:18:46,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:46" (1/1) ... [2018-01-31 08:18:46,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-31 08:18:46,476 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-31 08:18:46,476 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-31 08:18:46,477 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-31 08:18:46,478 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:46" (1/1) ... No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-31 08:18:46,548 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-31 08:18:46,548 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-31 08:18:46,548 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-31 08:18:46,548 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-31 08:18:46,548 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-31 08:18:46,549 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-31 08:18:46,549 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-31 08:18:46,551 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-31 08:18:46,551 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-31 08:18:46,552 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-31 08:18:46,552 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-31 08:18:46,552 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-31 08:18:47,095 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-31 08:18:47,096 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:18:47 BoogieIcfgContainer [2018-01-31 08:18:47,096 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-31 08:18:47,097 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-31 08:18:47,097 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-31 08:18:47,103 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-31 08:18:47,103 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.01 08:18:46" (1/3) ... [2018-01-31 08:18:47,104 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51cdeab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:18:47, skipping insertion in model container [2018-01-31 08:18:47,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.01 08:18:46" (2/3) ... [2018-01-31 08:18:47,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51cdeab5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.01 08:18:47, skipping insertion in model container [2018-01-31 08:18:47,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.01 08:18:47" (3/3) ... [2018-01-31 08:18:47,107 INFO L107 eAbstractionObserver]: Analyzing ICFG count_down-alloca_true-valid-memsafety_true-termination.i [2018-01-31 08:18:47,114 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-31 08:18:47,123 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-01-31 08:18:47,168 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-31 08:18:47,169 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-31 08:18:47,169 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-31 08:18:47,169 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-31 08:18:47,169 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-31 08:18:47,169 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-31 08:18:47,169 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-31 08:18:47,169 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-31 08:18:47,170 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-31 08:18:47,188 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states. [2018-01-31 08:18:47,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-31 08:18:47,198 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:47,200 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:47,200 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 08:18:47,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1229773359, now seen corresponding path program 1 times [2018-01-31 08:18:47,207 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:47,207 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:47,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:47,269 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:47,269 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:47,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:47,321 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:47,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:47,409 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:47,409 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:18:47,411 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:18:47,422 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:18:47,422 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:18:47,427 INFO L87 Difference]: Start difference. First operand 64 states. Second operand 4 states. [2018-01-31 08:18:47,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:47,660 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2018-01-31 08:18:47,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:18:47,662 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-01-31 08:18:47,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:47,672 INFO L225 Difference]: With dead ends: 94 [2018-01-31 08:18:47,673 INFO L226 Difference]: Without dead ends: 58 [2018-01-31 08:18:47,676 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:18:47,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-31 08:18:47,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2018-01-31 08:18:47,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-01-31 08:18:47,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2018-01-31 08:18:47,709 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 20 [2018-01-31 08:18:47,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:47,710 INFO L432 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2018-01-31 08:18:47,710 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:18:47,710 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2018-01-31 08:18:47,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 08:18:47,711 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:47,711 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:47,712 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 08:18:47,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1445043224, now seen corresponding path program 1 times [2018-01-31 08:18:47,712 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:47,712 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:47,713 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:47,713 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:47,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:47,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:47,731 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:47,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:47,822 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:47,822 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:18:47,824 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:18:47,824 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:18:47,824 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:18:47,825 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand 4 states. [2018-01-31 08:18:48,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:48,077 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-01-31 08:18:48,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:18:48,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-31 08:18:48,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:48,079 INFO L225 Difference]: With dead ends: 58 [2018-01-31 08:18:48,080 INFO L226 Difference]: Without dead ends: 54 [2018-01-31 08:18:48,081 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:18:48,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-01-31 08:18:48,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-01-31 08:18:48,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-01-31 08:18:48,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2018-01-31 08:18:48,090 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 24 [2018-01-31 08:18:48,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:48,091 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2018-01-31 08:18:48,091 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:18:48,091 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2018-01-31 08:18:48,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 08:18:48,092 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:48,092 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:48,092 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 08:18:48,093 INFO L82 PathProgramCache]: Analyzing trace with hash -1445043223, now seen corresponding path program 1 times [2018-01-31 08:18:48,093 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:48,093 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:48,094 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:48,094 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:48,095 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:48,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:48,122 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:48,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:48,260 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:48,260 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:18:48,261 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:18:48,261 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:18:48,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:18:48,261 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand 4 states. [2018-01-31 08:18:48,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:48,364 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2018-01-31 08:18:48,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:18:48,365 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-31 08:18:48,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:48,368 INFO L225 Difference]: With dead ends: 89 [2018-01-31 08:18:48,368 INFO L226 Difference]: Without dead ends: 65 [2018-01-31 08:18:48,368 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:18:48,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-31 08:18:48,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 56. [2018-01-31 08:18:48,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-01-31 08:18:48,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2018-01-31 08:18:48,376 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 24 [2018-01-31 08:18:48,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:48,376 INFO L432 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2018-01-31 08:18:48,376 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:18:48,377 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2018-01-31 08:18:48,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-31 08:18:48,377 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:48,378 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:48,378 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 08:18:48,378 INFO L82 PathProgramCache]: Analyzing trace with hash -1406967281, now seen corresponding path program 1 times [2018-01-31 08:18:48,378 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:48,378 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:48,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:48,379 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:48,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:48,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:48,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:48,728 WARN L146 SmtUtils]: Spent 139ms on a formula simplification. DAG size of input: 24 DAG size of output 14 [2018-01-31 08:18:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:48,831 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:48,831 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-31 08:18:48,832 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-31 08:18:48,832 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-31 08:18:48,832 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-01-31 08:18:48,832 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand 7 states. [2018-01-31 08:18:49,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:49,205 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2018-01-31 08:18:49,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-01-31 08:18:49,206 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 24 [2018-01-31 08:18:49,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:49,207 INFO L225 Difference]: With dead ends: 65 [2018-01-31 08:18:49,207 INFO L226 Difference]: Without dead ends: 64 [2018-01-31 08:18:49,208 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:18:49,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-01-31 08:18:49,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 62. [2018-01-31 08:18:49,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-01-31 08:18:49,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2018-01-31 08:18:49,220 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 24 [2018-01-31 08:18:49,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:49,223 INFO L432 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2018-01-31 08:18:49,223 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-31 08:18:49,223 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2018-01-31 08:18:49,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 08:18:49,224 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:49,225 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:49,225 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 08:18:49,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1322446552, now seen corresponding path program 1 times [2018-01-31 08:18:49,225 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:49,225 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:49,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:49,227 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:49,227 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:49,252 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:49,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:18:49,436 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:49,437 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-31 08:18:49,437 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-31 08:18:49,437 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-31 08:18:49,437 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-01-31 08:18:49,438 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 6 states. [2018-01-31 08:18:49,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:49,613 INFO L93 Difference]: Finished difference Result 84 states and 90 transitions. [2018-01-31 08:18:49,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-31 08:18:49,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-01-31 08:18:49,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:49,614 INFO L225 Difference]: With dead ends: 84 [2018-01-31 08:18:49,614 INFO L226 Difference]: Without dead ends: 81 [2018-01-31 08:18:49,615 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-01-31 08:18:49,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-01-31 08:18:49,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 73. [2018-01-31 08:18:49,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-01-31 08:18:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2018-01-31 08:18:49,623 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 34 [2018-01-31 08:18:49,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:49,623 INFO L432 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2018-01-31 08:18:49,623 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-31 08:18:49,623 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2018-01-31 08:18:49,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-01-31 08:18:49,624 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:49,625 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:49,625 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 08:18:49,625 INFO L82 PathProgramCache]: Analyzing trace with hash 1360522494, now seen corresponding path program 1 times [2018-01-31 08:18:49,625 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:49,625 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:49,626 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:49,626 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:49,627 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:49,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:49,639 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:50,034 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:50,034 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:18:50,034 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:18:50,049 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:50,100 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:18:50,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-01-31 08:18:50,140 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-31 08:18:50,151 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-31 08:18:50,152 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-31 08:18:50,403 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:50,438 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:18:50,438 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2018-01-31 08:18:50,439 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-31 08:18:50,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-31 08:18:50,440 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-01-31 08:18:50,440 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 11 states. [2018-01-31 08:18:50,789 WARN L143 SmtUtils]: Spent 111ms on a formula simplification that was a NOOP. DAG size: 19 [2018-01-31 08:18:51,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:51,076 INFO L93 Difference]: Finished difference Result 76 states and 83 transitions. [2018-01-31 08:18:51,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-01-31 08:18:51,077 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 34 [2018-01-31 08:18:51,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:51,078 INFO L225 Difference]: With dead ends: 76 [2018-01-31 08:18:51,079 INFO L226 Difference]: Without dead ends: 75 [2018-01-31 08:18:51,079 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-01-31 08:18:51,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-01-31 08:18:51,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 66. [2018-01-31 08:18:51,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-31 08:18:51,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 72 transitions. [2018-01-31 08:18:51,087 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 72 transitions. Word has length 34 [2018-01-31 08:18:51,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:51,087 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 72 transitions. [2018-01-31 08:18:51,088 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-31 08:18:51,088 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 72 transitions. [2018-01-31 08:18:51,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-01-31 08:18:51,089 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:51,089 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:51,089 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 08:18:51,089 INFO L82 PathProgramCache]: Analyzing trace with hash -440107211, now seen corresponding path program 1 times [2018-01-31 08:18:51,089 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:51,089 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:51,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:51,090 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:51,090 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:51,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:51,101 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:51,287 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-01-31 08:18:51,287 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:51,287 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-31 08:18:51,288 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:18:51,288 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:18:51,288 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:18:51,288 INFO L87 Difference]: Start difference. First operand 66 states and 72 transitions. Second operand 4 states. [2018-01-31 08:18:51,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:51,402 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2018-01-31 08:18:51,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-31 08:18:51,402 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 36 [2018-01-31 08:18:51,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:51,403 INFO L225 Difference]: With dead ends: 74 [2018-01-31 08:18:51,404 INFO L226 Difference]: Without dead ends: 69 [2018-01-31 08:18:51,404 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:18:51,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-01-31 08:18:51,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-01-31 08:18:51,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-01-31 08:18:51,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2018-01-31 08:18:51,411 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 36 [2018-01-31 08:18:51,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:51,411 INFO L432 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2018-01-31 08:18:51,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:18:51,411 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2018-01-31 08:18:51,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-01-31 08:18:51,412 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:51,412 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:51,413 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 08:18:51,413 INFO L82 PathProgramCache]: Analyzing trace with hash 1074356498, now seen corresponding path program 1 times [2018-01-31 08:18:51,413 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:51,413 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:51,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:51,414 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:51,414 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:51,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:51,427 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:51,594 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:51,595 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:18:51,595 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:18:51,604 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:51,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:51,636 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:18:52,152 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:52,171 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:18:52,172 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 14 [2018-01-31 08:18:52,172 INFO L409 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-01-31 08:18:52,172 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-01-31 08:18:52,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2018-01-31 08:18:52,173 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 14 states. [2018-01-31 08:18:52,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:52,672 INFO L93 Difference]: Finished difference Result 157 states and 170 transitions. [2018-01-31 08:18:52,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-01-31 08:18:52,672 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 43 [2018-01-31 08:18:52,673 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:52,674 INFO L225 Difference]: With dead ends: 157 [2018-01-31 08:18:52,674 INFO L226 Difference]: Without dead ends: 134 [2018-01-31 08:18:52,675 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 115 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=145, Invalid=557, Unknown=0, NotChecked=0, Total=702 [2018-01-31 08:18:52,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-01-31 08:18:52,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 112. [2018-01-31 08:18:52,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-01-31 08:18:52,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2018-01-31 08:18:52,688 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 43 [2018-01-31 08:18:52,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:52,689 INFO L432 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2018-01-31 08:18:52,689 INFO L433 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-01-31 08:18:52,689 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2018-01-31 08:18:52,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-01-31 08:18:52,691 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:52,691 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:52,691 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 08:18:52,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1663519471, now seen corresponding path program 1 times [2018-01-31 08:18:52,691 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:52,691 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:52,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:52,692 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:52,692 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:52,708 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:52,777 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-01-31 08:18:52,777 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-31 08:18:52,777 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-31 08:18:52,777 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-31 08:18:52,777 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-31 08:18:52,777 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-31 08:18:52,778 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand 4 states. [2018-01-31 08:18:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:52,872 INFO L93 Difference]: Finished difference Result 112 states and 122 transitions. [2018-01-31 08:18:52,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-31 08:18:52,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 45 [2018-01-31 08:18:52,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:52,873 INFO L225 Difference]: With dead ends: 112 [2018-01-31 08:18:52,873 INFO L226 Difference]: Without dead ends: 71 [2018-01-31 08:18:52,874 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-31 08:18:52,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-01-31 08:18:52,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-01-31 08:18:52,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-01-31 08:18:52,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2018-01-31 08:18:52,883 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 45 [2018-01-31 08:18:52,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:52,884 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2018-01-31 08:18:52,884 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-31 08:18:52,884 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2018-01-31 08:18:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-01-31 08:18:52,885 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:52,886 INFO L351 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:52,886 INFO L371 AbstractCegarLoop]: === Iteration 10 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 08:18:52,886 INFO L82 PathProgramCache]: Analyzing trace with hash -331630141, now seen corresponding path program 2 times [2018-01-31 08:18:52,886 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:52,886 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:52,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:52,887 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-31 08:18:52,887 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:52,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:52,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:53,258 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:53,258 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:18:53,258 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:18:53,264 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-01-31 08:18:53,276 INFO L201 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:18:53,289 INFO L214 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued a check-sat command [2018-01-31 08:18:53,293 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:18:53,296 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:18:53,471 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:53,516 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:18:53,516 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 20 [2018-01-31 08:18:53,516 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:18:53,517 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:18:53,517 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=338, Unknown=0, NotChecked=0, Total=420 [2018-01-31 08:18:53,517 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand 21 states. [2018-01-31 08:18:54,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:54,171 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2018-01-31 08:18:54,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-01-31 08:18:54,172 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 53 [2018-01-31 08:18:54,172 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:54,173 INFO L225 Difference]: With dead ends: 92 [2018-01-31 08:18:54,173 INFO L226 Difference]: Without dead ends: 89 [2018-01-31 08:18:54,174 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=232, Invalid=760, Unknown=0, NotChecked=0, Total=992 [2018-01-31 08:18:54,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-01-31 08:18:54,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-01-31 08:18:54,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-31 08:18:54,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 92 transitions. [2018-01-31 08:18:54,182 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 92 transitions. Word has length 53 [2018-01-31 08:18:54,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:54,185 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 92 transitions. [2018-01-31 08:18:54,185 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:18:54,186 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 92 transitions. [2018-01-31 08:18:54,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-01-31 08:18:54,187 INFO L343 BasicCegarLoop]: Found error trace [2018-01-31 08:18:54,187 INFO L351 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-31 08:18:54,187 INFO L371 AbstractCegarLoop]: === Iteration 11 === [mainErr5RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr7RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr0RequiresViolation, mainErr8EnsuresViolation]=== [2018-01-31 08:18:54,188 INFO L82 PathProgramCache]: Analyzing trace with hash 1783541383, now seen corresponding path program 3 times [2018-01-31 08:18:54,188 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-31 08:18:54,188 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-31 08:18:54,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:54,189 INFO L99 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-01-31 08:18:54,189 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-31 08:18:54,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-31 08:18:54,201 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-31 08:18:54,354 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-31 08:18:54,354 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-31 08:18:54,354 INFO L209 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-31 08:18:54,359 INFO L101 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-01-31 08:18:54,369 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:18:54,387 INFO L254 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued a check-sat command [2018-01-31 08:18:54,396 INFO L239 tOrderPrioritization]: Conjunction of SSA is unsat [2018-01-31 08:18:54,400 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-31 08:18:55,063 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 16 proven. 4 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2018-01-31 08:18:55,082 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-01-31 08:18:55,082 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9] total 21 [2018-01-31 08:18:55,082 INFO L409 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-01-31 08:18:55,083 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-01-31 08:18:55,083 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=369, Unknown=0, NotChecked=0, Total=420 [2018-01-31 08:18:55,083 INFO L87 Difference]: Start difference. First operand 86 states and 92 transitions. Second operand 21 states. [2018-01-31 08:18:56,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-31 08:18:56,455 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2018-01-31 08:18:56,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-01-31 08:18:56,456 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 62 [2018-01-31 08:18:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-31 08:18:56,456 INFO L225 Difference]: With dead ends: 157 [2018-01-31 08:18:56,456 INFO L226 Difference]: Without dead ends: 0 [2018-01-31 08:18:56,458 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 556 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=383, Invalid=2067, Unknown=0, NotChecked=0, Total=2450 [2018-01-31 08:18:56,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-31 08:18:56,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-31 08:18:56,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-31 08:18:56,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-31 08:18:56,459 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 62 [2018-01-31 08:18:56,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-31 08:18:56,459 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-31 08:18:56,459 INFO L433 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-01-31 08:18:56,459 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-31 08:18:56,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-31 08:18:56,463 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-31 08:18:57,657 WARN L146 SmtUtils]: Spent 1059ms on a formula simplification. DAG size of input: 79 DAG size of output 54 [2018-01-31 08:18:57,925 WARN L146 SmtUtils]: Spent 262ms on a formula simplification. DAG size of input: 70 DAG size of output 51 [2018-01-31 08:18:58,025 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 560) no Hoare annotation was computed. [2018-01-31 08:18:58,025 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-31 08:18:58,026 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:18:58,026 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-31 08:18:58,026 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 560) the Hoare annotation is: true [2018-01-31 08:18:58,026 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 560) no Hoare annotation was computed. [2018-01-31 08:18:58,026 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 560) the Hoare annotation is: true [2018-01-31 08:18:58,026 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 560) no Hoare annotation was computed. [2018-01-31 08:18:58,026 INFO L399 ceAbstractionStarter]: For program point mainErr1RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-31 08:18:58,026 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-31 08:18:58,026 INFO L399 ceAbstractionStarter]: For program point L541(line 541) no Hoare annotation was computed. [2018-01-31 08:18:58,027 INFO L399 ceAbstractionStarter]: For program point mainErr8EnsuresViolation(lines 540 560) no Hoare annotation was computed. [2018-01-31 08:18:58,027 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-31 08:18:58,027 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-31 08:18:58,027 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-31 08:18:58,027 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-31 08:18:58,027 INFO L399 ceAbstractionStarter]: For program point L549(lines 549 551) no Hoare annotation was computed. [2018-01-31 08:18:58,027 INFO L399 ceAbstractionStarter]: For program point mainErr0RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-31 08:18:58,027 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-31 08:18:58,027 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-31 08:18:58,028 INFO L395 ceAbstractionStarter]: At program point L554'''''(lines 554 558) the Hoare annotation is: (let ((.cse11 (* 4 main_~length~2))) (let ((.cse0 (not (= 0 main_~arr~2.base))) (.cse1 (= main_~arr~2.offset 0)) (.cse2 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse3 (= .cse11 (select |#length| main_~arr~2.base))) (.cse4 (not (= 0 |main_#t~malloc1.base|))) (.cse5 (= 1 (select |#valid| |main_#t~malloc1.base|))) (.cse6 (= 1 (select |#valid| main_~arr~2.base))) (.cse7 (<= 1 main_~i~2)) (.cse8 (exists ((v_prenex_1 Int)) (and (<= (+ main_~arr~2.offset (* 4 v_prenex_1) 4) (select |#length| main_~arr~2.base)) (<= main_~i~2 (+ v_prenex_1 1))))) (.cse9 (= 0 |main_#t~malloc1.offset|)) (.cse10 (= .cse11 (select |#length| |main_#t~malloc1.base|)))) (or (and .cse0 .cse1 .cse2 (= main_~j~2 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_prenex_2 Int)) (and (<= (+ v_prenex_2 1) main_~j~2) (<= 0 (+ (* 4 v_prenex_2) main_~arr~2.offset)))) .cse6 .cse7 .cse8 .cse9 .cse10)))) [2018-01-31 08:18:58,028 INFO L399 ceAbstractionStarter]: For program point mainErr2RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-31 08:18:58,028 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-31 08:18:58,028 INFO L399 ceAbstractionStarter]: For program point L554''(lines 554 558) no Hoare annotation was computed. [2018-01-31 08:18:58,028 INFO L399 ceAbstractionStarter]: For program point L556''(line 556) no Hoare annotation was computed. [2018-01-31 08:18:58,028 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 540 560) no Hoare annotation was computed. [2018-01-31 08:18:58,028 INFO L399 ceAbstractionStarter]: For program point mainErr4RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-31 08:18:58,028 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 540 560) no Hoare annotation was computed. [2018-01-31 08:18:58,028 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 540 560) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-31 08:18:58,028 INFO L399 ceAbstractionStarter]: For program point mainErr7RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-31 08:18:58,029 INFO L399 ceAbstractionStarter]: For program point L554'''(line 554) no Hoare annotation was computed. [2018-01-31 08:18:58,029 INFO L399 ceAbstractionStarter]: For program point L547''''(line 547) no Hoare annotation was computed. [2018-01-31 08:18:58,029 INFO L399 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-31 08:18:58,029 INFO L399 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-31 08:18:58,029 INFO L399 ceAbstractionStarter]: For program point L555'(line 555) no Hoare annotation was computed. [2018-01-31 08:18:58,029 INFO L399 ceAbstractionStarter]: For program point L543''(line 543) no Hoare annotation was computed. [2018-01-31 08:18:58,029 INFO L399 ceAbstractionStarter]: For program point L547'(lines 547 553) no Hoare annotation was computed. [2018-01-31 08:18:58,029 INFO L399 ceAbstractionStarter]: For program point L549''(lines 549 551) no Hoare annotation was computed. [2018-01-31 08:18:58,029 INFO L399 ceAbstractionStarter]: For program point L547''''''(lines 547 553) no Hoare annotation was computed. [2018-01-31 08:18:58,029 INFO L399 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-31 08:18:58,029 INFO L399 ceAbstractionStarter]: For program point mainErr6RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-31 08:18:58,030 INFO L399 ceAbstractionStarter]: For program point mainErr5RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-31 08:18:58,030 INFO L399 ceAbstractionStarter]: For program point L545''''(line 545) no Hoare annotation was computed. [2018-01-31 08:18:58,030 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-31 08:18:58,030 INFO L399 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-31 08:18:58,030 INFO L399 ceAbstractionStarter]: For program point L547'''(line 547) no Hoare annotation was computed. [2018-01-31 08:18:58,030 INFO L399 ceAbstractionStarter]: For program point L548'(line 548) no Hoare annotation was computed. [2018-01-31 08:18:58,030 INFO L399 ceAbstractionStarter]: For program point L555''(line 555) no Hoare annotation was computed. [2018-01-31 08:18:58,030 INFO L399 ceAbstractionStarter]: For program point L545'''(line 545) no Hoare annotation was computed. [2018-01-31 08:18:58,030 INFO L399 ceAbstractionStarter]: For program point mainErr3RequiresViolation(lines 1 560) no Hoare annotation was computed. [2018-01-31 08:18:58,030 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-31 08:18:58,030 INFO L399 ceAbstractionStarter]: For program point L550(line 550) no Hoare annotation was computed. [2018-01-31 08:18:58,030 INFO L399 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-31 08:18:58,030 INFO L399 ceAbstractionStarter]: For program point L555(lines 555 557) no Hoare annotation was computed. [2018-01-31 08:18:58,030 INFO L399 ceAbstractionStarter]: For program point L554(lines 554 558) no Hoare annotation was computed. [2018-01-31 08:18:58,030 INFO L399 ceAbstractionStarter]: For program point L554''''(line 554) no Hoare annotation was computed. [2018-01-31 08:18:58,031 INFO L399 ceAbstractionStarter]: For program point L556'''(line 556) no Hoare annotation was computed. [2018-01-31 08:18:58,031 INFO L399 ceAbstractionStarter]: For program point L556''''(line 556) no Hoare annotation was computed. [2018-01-31 08:18:58,031 INFO L399 ceAbstractionStarter]: For program point L554''''''(lines 554 558) no Hoare annotation was computed. [2018-01-31 08:18:58,031 INFO L399 ceAbstractionStarter]: For program point L555''''(line 555) no Hoare annotation was computed. [2018-01-31 08:18:58,031 INFO L399 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-31 08:18:58,031 INFO L395 ceAbstractionStarter]: At program point L555'''''(lines 555 557) the Hoare annotation is: (let ((.cse11 (* 4 main_~length~2))) (let ((.cse0 (not (= 0 main_~arr~2.base))) (.cse1 (= main_~arr~2.offset 0)) (.cse2 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse3 (= .cse11 (select |#length| main_~arr~2.base))) (.cse4 (not (= 0 |main_#t~malloc1.base|))) (.cse5 (= 1 (select |#valid| |main_#t~malloc1.base|))) (.cse6 (= 1 (select |#valid| main_~arr~2.base))) (.cse7 (<= 1 main_~i~2)) (.cse8 (exists ((v_prenex_1 Int)) (and (<= (+ main_~arr~2.offset (* 4 v_prenex_1) 4) (select |#length| main_~arr~2.base)) (<= main_~i~2 (+ v_prenex_1 1))))) (.cse9 (= 0 |main_#t~malloc1.offset|)) (.cse10 (= .cse11 (select |#length| |main_#t~malloc1.base|)))) (or (and .cse0 .cse1 .cse2 (= main_~j~2 0) .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9 .cse10) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (exists ((v_prenex_2 Int)) (and (<= (+ v_prenex_2 1) main_~j~2) (<= 0 (+ (* 4 v_prenex_2) main_~arr~2.offset)))) .cse6 .cse7 (exists ((v_prenex_1 Int)) (and (<= (+ main_~arr~2.offset (* 4 v_prenex_1) 4) (select |#length| main_~arr~2.base)) (<= main_~j~2 v_prenex_1))) .cse8 .cse9 .cse10)))) [2018-01-31 08:18:58,031 INFO L399 ceAbstractionStarter]: For program point L548''(line 548) no Hoare annotation was computed. [2018-01-31 08:18:58,031 INFO L395 ceAbstractionStarter]: At program point L547'''''(lines 547 553) the Hoare annotation is: (let ((.cse9 (* 4 main_~length~2))) (let ((.cse0 (not (= 0 main_~arr~2.base))) (.cse6 (= 1 (select |#valid| main_~arr~2.base))) (.cse1 (= main_~arr~2.offset 0)) (.cse2 (= |old(#valid)| (store |#valid| |main_#t~malloc1.base| 0))) (.cse7 (= 0 |main_#t~malloc1.offset|)) (.cse3 (= .cse9 (select |#length| main_~arr~2.base))) (.cse4 (not (= 0 |main_#t~malloc1.base|))) (.cse5 (= 1 (select |#valid| |main_#t~malloc1.base|))) (.cse8 (= .cse9 (select |#length| |main_#t~malloc1.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= 1 main_~i~2) (exists ((v_prenex_1 Int)) (and (<= (+ main_~arr~2.offset (* 4 v_prenex_1) 4) (select |#length| main_~arr~2.base)) (<= main_~i~2 (+ v_prenex_1 1)))) .cse7 .cse8) (and .cse0 .cse6 .cse1 .cse2 (<= 1 main_~length~2) .cse7 .cse3 .cse4 .cse5 .cse8 (= main_~i~2 0))))) [2018-01-31 08:18:58,039 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,040 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,040 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-31 08:18:58,041 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-31 08:18:58,041 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,042 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,042 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,043 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,045 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,045 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,045 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,046 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,046 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,046 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,047 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,057 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,057 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,057 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-31 08:18:58,058 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-31 08:18:58,058 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,058 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,058 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,059 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,059 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,059 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,059 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,060 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,060 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,060 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,060 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,064 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,065 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,065 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-31 08:18:58,065 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-31 08:18:58,066 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,066 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,074 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,075 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,075 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,075 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,075 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,076 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,078 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,078 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,078 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-31 08:18:58,078 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-31 08:18:58,079 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,081 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,081 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,081 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,081 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,082 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,082 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,082 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,084 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,086 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,086 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,086 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,087 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,087 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,087 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,088 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,089 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,094 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,095 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,097 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.01 08:18:58 BoogieIcfgContainer [2018-01-31 08:18:58,097 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-31 08:18:58,098 INFO L168 Benchmark]: Toolchain (without parser) took 11983.22 ms. Allocated memory was 308.3 MB in the beginning and 548.9 MB in the end (delta: 240.6 MB). Free memory was 268.0 MB in the beginning and 425.7 MB in the end (delta: -157.7 MB). Peak memory consumption was 179.6 MB. Max. memory is 5.3 GB. [2018-01-31 08:18:58,099 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 308.3 MB. Free memory is still 274.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-31 08:18:58,099 INFO L168 Benchmark]: CACSL2BoogieTranslator took 307.95 ms. Allocated memory is still 308.3 MB. Free memory was 267.0 MB in the beginning and 257.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:18:58,100 INFO L168 Benchmark]: Boogie Preprocessor took 39.98 ms. Allocated memory is still 308.3 MB. Free memory was 257.0 MB in the beginning and 255.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-31 08:18:58,100 INFO L168 Benchmark]: RCFGBuilder took 619.81 ms. Allocated memory is still 308.3 MB. Free memory was 255.1 MB in the beginning and 237.0 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 5.3 GB. [2018-01-31 08:18:58,100 INFO L168 Benchmark]: TraceAbstraction took 11000.17 ms. Allocated memory was 308.3 MB in the beginning and 548.9 MB in the end (delta: 240.6 MB). Free memory was 236.0 MB in the beginning and 425.7 MB in the end (delta: -189.7 MB). Peak memory consumption was 147.6 MB. Max. memory is 5.3 GB. [2018-01-31 08:18:58,102 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.13 ms. Allocated memory is still 308.3 MB. Free memory is still 274.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 307.95 ms. Allocated memory is still 308.3 MB. Free memory was 267.0 MB in the beginning and 257.0 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 39.98 ms. Allocated memory is still 308.3 MB. Free memory was 257.0 MB in the beginning and 255.1 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 619.81 ms. Allocated memory is still 308.3 MB. Free memory was 255.1 MB in the beginning and 237.0 MB in the end (delta: 18.1 MB). Peak memory consumption was 18.1 MB. Max. memory is 5.3 GB. * TraceAbstraction took 11000.17 ms. Allocated memory was 308.3 MB in the beginning and 548.9 MB in the end (delta: 240.6 MB). Free memory was 236.0 MB in the beginning and 425.7 MB in the end (delta: -189.7 MB). Peak memory consumption was 147.6 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] * 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 - 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 - 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: 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: 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: 540]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 9 specifications checked. All of them hold - InvariantResult [Line: 555]: Loop Invariant [2018-01-31 08:18:58,109 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,110 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,110 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-31 08:18:58,110 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-31 08:18:58,110 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,110 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,111 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,111 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,111 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,111 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,111 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,111 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,112 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,112 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,112 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,114 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,114 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,114 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-31 08:18:58,114 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-31 08:18:58,115 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,115 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,115 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,115 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,115 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,116 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,116 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,116 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,116 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,116 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,117 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((!(0 == arr) && arr == 0) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && j == 0) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 1 <= i) && (\exists v_prenex_1 : int :: arr + 4 * v_prenex_1 + 4 <= unknown-#length-unknown[arr] && i <= v_prenex_1 + 1)) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) || ((((((((((((!(0 == arr) && arr == 0) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && (\exists v_prenex_2 : int :: v_prenex_2 + 1 <= j && 0 <= 4 * v_prenex_2 + arr)) && 1 == \valid[arr]) && 1 <= i) && (\exists v_prenex_1 : int :: arr + 4 * v_prenex_1 + 4 <= unknown-#length-unknown[arr] && j <= v_prenex_1)) && (\exists v_prenex_1 : int :: arr + 4 * v_prenex_1 + 4 <= unknown-#length-unknown[arr] && i <= v_prenex_1 + 1)) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) - InvariantResult [Line: 554]: Loop Invariant [2018-01-31 08:18:58,118 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,119 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,119 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-31 08:18:58,119 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-31 08:18:58,119 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,119 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,120 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,120 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,120 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,120 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,120 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,121 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,122 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,122 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,123 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-31 08:18:58,123 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_2,QUANTIFIED] [2018-01-31 08:18:58,123 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,123 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,124 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,124 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,124 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,124 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,124 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,125 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((!(0 == arr) && arr == 0) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && j == 0) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 1 <= i) && (\exists v_prenex_1 : int :: arr + 4 * v_prenex_1 + 4 <= unknown-#length-unknown[arr] && i <= v_prenex_1 + 1)) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) || (((((((((((!(0 == arr) && arr == 0) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && (\exists v_prenex_2 : int :: v_prenex_2 + 1 <= j && 0 <= 4 * v_prenex_2 + arr)) && 1 == \valid[arr]) && 1 <= i) && (\exists v_prenex_1 : int :: arr + 4 * v_prenex_1 + 4 <= unknown-#length-unknown[arr] && i <= v_prenex_1 + 1)) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) - InvariantResult [Line: 547]: Loop Invariant [2018-01-31 08:18:58,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,126 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,127 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,127 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,127 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,128 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,128 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,129 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,130 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_prenex_1,QUANTIFIED] [2018-01-31 08:18:58,130 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,130 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,130 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,131 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-31 08:18:58,131 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((!(0 == arr) && arr == 0) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 1 == \valid[arr]) && 1 <= i) && (\exists v_prenex_1 : int :: arr + 4 * v_prenex_1 + 4 <= unknown-#length-unknown[arr] && i <= v_prenex_1 + 1)) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) || ((((((((((!(0 == arr) && 1 == \valid[arr]) && arr == 0) && \old(\valid) == \valid[__builtin_alloca (length*sizeof(int)) := 0]) && 1 <= length) && 0 == __builtin_alloca (length*sizeof(int))) && 4 * length == unknown-#length-unknown[arr]) && !(0 == __builtin_alloca (length*sizeof(int)))) && 1 == \valid[__builtin_alloca (length*sizeof(int))]) && 4 * length == unknown-#length-unknown[__builtin_alloca (length*sizeof(int))]) && i == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 64 locations, 9 error locations. SAFE Result, 10.8s OverallTime, 11 OverallIterations, 3 TraceHistogramMax, 4.5s AutomataDifference, 0.0s DeadEndRemovalTime, 1.5s HoareAnnotationTime, HoareTripleCheckerStatistics: 539 SDtfs, 1427 SDslu, 2109 SDs, 0 SdLazy, 1132 SolverSat, 77 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 333 GetRequests, 180 SyntacticMatches, 6 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 4.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=112occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 56 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 28 NumberOfFragments, 436 HoareAnnotationTreeSize, 7 FomulaSimplifications, 805 FormulaSimplificationTreeSizeReduction, 0.1s HoareSimplificationTime, 7 FomulaSimplificationsInter, 814 FormulaSimplificationTreeSizeReductionInter, 1.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 591 NumberOfCodeBlocks, 572 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 576 ConstructedInterpolants, 51 QuantifiedInterpolants, 165358 SizeOfPredicates, 24 NumberOfNonLiveVariables, 375 ConjunctsInSsa, 42 ConjunctsInUnsatCore, 15 InterpolantComputations, 7 PerfectInterpolantSequences, 57/132 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: 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/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-31_08-18-58-136.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/count_down-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-31_08-18-58-136.csv Received shutdown request...