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_Taipan+AI_EQ_preciseopt.epf -i ../../../trunk/examples/svcomp/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-6b94a2f [2018-01-25 02:31:36,226 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-25 02:31:36,227 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-25 02:31:36,243 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-25 02:31:36,244 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-25 02:31:36,245 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-25 02:31:36,246 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-25 02:31:36,248 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-25 02:31:36,250 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-25 02:31:36,251 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-25 02:31:36,252 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-25 02:31:36,252 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-25 02:31:36,253 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-25 02:31:36,255 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-25 02:31:36,256 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-25 02:31:36,258 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-25 02:31:36,260 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-25 02:31:36,263 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-25 02:31:36,264 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-25 02:31:36,266 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-25 02:31:36,268 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-25 02:31:36,269 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-25 02:31:36,269 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-25 02:31:36,270 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-25 02:31:36,271 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-25 02:31:36,272 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-25 02:31:36,272 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-25 02:31:36,273 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-25 02:31:36,273 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-25 02:31:36,274 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-25 02:31:36,274 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-25 02:31:36,275 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf [2018-01-25 02:31:36,285 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-25 02:31:36,285 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-25 02:31:36,286 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-25 02:31:36,286 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-25 02:31:36,286 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-25 02:31:36,287 INFO L133 SettingsManager]: * Weq Fattening=true [2018-01-25 02:31:36,287 INFO L133 SettingsManager]: * Flatten before fatten=true [2018-01-25 02:31:36,287 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-25 02:31:36,287 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-25 02:31:36,288 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-25 02:31:36,288 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-25 02:31:36,288 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-25 02:31:36,288 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-25 02:31:36,289 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-25 02:31:36,289 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-25 02:31:36,289 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-25 02:31:36,289 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-25 02:31:36,289 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-25 02:31:36,289 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-25 02:31:36,290 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-25 02:31:36,290 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-25 02:31:36,290 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-01-25 02:31:36,290 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-25 02:31:36,290 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-25 02:31:36,291 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-25 02:31:36,291 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-25 02:31:36,291 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-25 02:31:36,291 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-25 02:31:36,292 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-25 02:31:36,292 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-25 02:31:36,292 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-01-25 02:31:36,292 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-25 02:31:36,292 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-25 02:31:36,292 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-25 02:31:36,293 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-01-25 02:31:36,293 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-25 02:31:36,294 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-25 02:31:36,330 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-25 02:31:36,344 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-25 02:31:36,348 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-25 02:31:36,349 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-25 02:31:36,350 INFO L276 PluginConnector]: CDTParser initialized [2018-01-25 02:31:36,351 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/array01-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:31:36,610 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-25 02:31:36,615 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-25 02:31:36,616 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-25 02:31:36,616 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-25 02:31:36,629 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-25 02:31:36,631 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:31:36" (1/1) ... [2018-01-25 02:31:36,635 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d8c01df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:31:36, skipping insertion in model container [2018-01-25 02:31:36,635 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.01 02:31:36" (1/1) ... [2018-01-25 02:31:36,655 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:31:36,693 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-25 02:31:36,835 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:31:36,851 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-25 02:31:36,856 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:31:36 WrapperNode [2018-01-25 02:31:36,856 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-25 02:31:36,857 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-25 02:31:36,857 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-25 02:31:36,857 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-25 02:31:36,870 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:31:36" (1/1) ... [2018-01-25 02:31:36,870 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:31:36" (1/1) ... [2018-01-25 02:31:36,882 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:31:36" (1/1) ... [2018-01-25 02:31:36,882 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:31:36" (1/1) ... [2018-01-25 02:31:36,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:31:36" (1/1) ... [2018-01-25 02:31:36,890 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:31:36" (1/1) ... [2018-01-25 02:31:36,891 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:31:36" (1/1) ... [2018-01-25 02:31:36,892 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-25 02:31:36,893 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-25 02:31:36,893 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-25 02:31:36,893 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-25 02:31:36,894 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:31:36" (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-25 02:31:36,942 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-25 02:31:36,942 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-25 02:31:36,943 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-01-25 02:31:36,943 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-25 02:31:36,943 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-25 02:31:36,943 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-25 02:31:36,943 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-25 02:31:36,944 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-25 02:31:36,944 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-25 02:31:36,944 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-25 02:31:36,944 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-01-25 02:31:36,944 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-25 02:31:36,944 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-25 02:31:36,945 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-25 02:31:37,159 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-25 02:31:37,161 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:31:37 BoogieIcfgContainer [2018-01-25 02:31:37,161 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-25 02:31:37,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-25 02:31:37,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-25 02:31:37,164 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-25 02:31:37,164 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.01 02:31:36" (1/3) ... [2018-01-25 02:31:37,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6102cb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:31:37, skipping insertion in model container [2018-01-25 02:31:37,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.01 02:31:36" (2/3) ... [2018-01-25 02:31:37,165 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6102cb42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.01 02:31:37, skipping insertion in model container [2018-01-25 02:31:37,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.01 02:31:37" (3/3) ... [2018-01-25 02:31:37,167 INFO L105 eAbstractionObserver]: Analyzing ICFG array01-alloca_true-valid-memsafety_true-termination.i [2018-01-25 02:31:37,174 INFO L130 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-25 02:31:37,180 INFO L142 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-01-25 02:31:37,222 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-25 02:31:37,222 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-25 02:31:37,223 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-25 02:31:37,223 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-25 02:31:37,223 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-25 02:31:37,223 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-25 02:31:37,223 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-25 02:31:37,223 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-25 02:31:37,224 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-25 02:31:37,253 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-01-25 02:31:37,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 02:31:37,261 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:31:37,262 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:31:37,262 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:31:37,267 INFO L82 PathProgramCache]: Analyzing trace with hash -55325045, now seen corresponding path program 1 times [2018-01-25 02:31:37,270 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:31:37,330 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:31:37,330 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:31:37,331 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:31:37,331 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:31:37,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:31:37,407 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:31:37,625 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-25 02:31:37,627 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:31:37,627 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:31:37,627 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:31:37,630 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:31:37,640 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:31:37,641 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:31:37,643 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 6 states. [2018-01-25 02:31:37,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:31:37,903 INFO L93 Difference]: Finished difference Result 62 states and 72 transitions. [2018-01-25 02:31:37,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:31:37,984 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 15 [2018-01-25 02:31:37,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:31:37,996 INFO L225 Difference]: With dead ends: 62 [2018-01-25 02:31:37,996 INFO L226 Difference]: Without dead ends: 32 [2018-01-25 02:31:37,999 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-01-25 02:31:38,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-01-25 02:31:38,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-01-25 02:31:38,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-01-25 02:31:38,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-01-25 02:31:38,034 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2018-01-25 02:31:38,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:31:38,034 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-01-25 02:31:38,034 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:31:38,034 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-01-25 02:31:38,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-01-25 02:31:38,035 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:31:38,035 INFO L322 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:31:38,036 INFO L371 AbstractCegarLoop]: === Iteration 2 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:31:38,036 INFO L82 PathProgramCache]: Analyzing trace with hash -55325044, now seen corresponding path program 1 times [2018-01-25 02:31:38,036 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:31:38,037 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:31:38,037 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:31:38,038 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:31:38,038 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:31:38,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:31:38,061 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:31:38,316 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-25 02:31:38,316 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:31:38,316 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-01-25 02:31:38,316 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:31:38,317 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-01-25 02:31:38,318 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-01-25 02:31:38,318 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-01-25 02:31:38,318 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2018-01-25 02:31:38,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:31:38,526 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2018-01-25 02:31:38,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-01-25 02:31:38,527 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-01-25 02:31:38,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:31:38,530 INFO L225 Difference]: With dead ends: 48 [2018-01-25 02:31:38,530 INFO L226 Difference]: Without dead ends: 45 [2018-01-25 02:31:38,531 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-01-25 02:31:38,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-01-25 02:31:38,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2018-01-25 02:31:38,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 02:31:38,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-01-25 02:31:38,540 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 15 [2018-01-25 02:31:38,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:31:38,540 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-01-25 02:31:38,540 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-01-25 02:31:38,540 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-01-25 02:31:38,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-01-25 02:31:38,541 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:31:38,542 INFO L322 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-25 02:31:38,542 INFO L371 AbstractCegarLoop]: === Iteration 3 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:31:38,542 INFO L82 PathProgramCache]: Analyzing trace with hash -195737667, now seen corresponding path program 1 times [2018-01-25 02:31:38,542 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:31:38,543 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:31:38,543 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:31:38,544 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:31:38,544 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:31:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:31:38,559 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:31:38,655 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-25 02:31:38,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:31:38,656 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-01-25 02:31:38,656 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:31:38,656 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-25 02:31:38,656 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-25 02:31:38,657 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-01-25 02:31:38,657 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-01-25 02:31:38,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:31:38,720 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-01-25 02:31:38,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:31:38,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-01-25 02:31:38,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:31:38,721 INFO L225 Difference]: With dead ends: 50 [2018-01-25 02:31:38,721 INFO L226 Difference]: Without dead ends: 42 [2018-01-25 02:31:38,722 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-01-25 02:31:38,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-01-25 02:31:38,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-01-25 02:31:38,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-01-25 02:31:38,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-01-25 02:31:38,729 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 20 [2018-01-25 02:31:38,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:31:38,729 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-01-25 02:31:38,729 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-25 02:31:38,730 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-01-25 02:31:38,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 02:31:38,731 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:31:38,731 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:31:38,731 INFO L371 AbstractCegarLoop]: === Iteration 4 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:31:38,731 INFO L82 PathProgramCache]: Analyzing trace with hash 1506152513, now seen corresponding path program 1 times [2018-01-25 02:31:38,731 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:31:38,732 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:31:38,733 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:31:38,733 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:31:38,733 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:31:38,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:31:38,765 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:31:38,906 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:31:38,907 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:31:38,907 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:31:38,908 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-01-25 02:31:38,909 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [15], [17], [19], [22], [36], [45], [48], [52], [53], [60], [61], [62], [64] [2018-01-25 02:31:38,960 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:31:38,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:31:39,956 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:31:39,957 INFO L268 AbstractInterpreter]: Visited 18 different actions 25 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-01-25 02:31:40,000 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:31:40,001 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:31:40,001 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:31:40,015 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:31:40,015 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:31:40,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:31:40,054 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:31:40,160 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:31:40,160 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:31:40,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:31:40,278 INFO L320 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-01-25 02:31:40,278 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6, 6] imperfect sequences [9] total 14 [2018-01-25 02:31:40,279 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:31:40,279 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-01-25 02:31:40,279 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-01-25 02:31:40,280 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2018-01-25 02:31:40,280 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 6 states. [2018-01-25 02:31:40,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:31:40,359 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2018-01-25 02:31:40,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-01-25 02:31:40,361 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-01-25 02:31:40,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:31:40,363 INFO L225 Difference]: With dead ends: 86 [2018-01-25 02:31:40,363 INFO L226 Difference]: Without dead ends: 65 [2018-01-25 02:31:40,364 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-01-25 02:31:40,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-01-25 02:31:40,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-01-25 02:31:40,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-01-25 02:31:40,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-01-25 02:31:40,375 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 21 [2018-01-25 02:31:40,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:31:40,375 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-01-25 02:31:40,375 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-01-25 02:31:40,376 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-01-25 02:31:40,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-01-25 02:31:40,377 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:31:40,377 INFO L322 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:31:40,377 INFO L371 AbstractCegarLoop]: === Iteration 5 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:31:40,377 INFO L82 PathProgramCache]: Analyzing trace with hash 226288835, now seen corresponding path program 1 times [2018-01-25 02:31:40,377 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:31:40,378 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:31:40,378 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:31:40,379 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:31:40,379 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:31:40,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:31:40,395 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:31:40,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:31:40,709 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:31:40,709 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-01-25 02:31:40,709 INFO L199 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-01-25 02:31:40,710 INFO L201 CegarAbsIntRunner]: [0], [1], [2], [6], [11], [15], [17], [19], [22], [36], [45], [50], [52], [53], [60], [61], [62], [64] [2018-01-25 02:31:40,711 INFO L147 AbstractInterpreter]: Using domain VPDomain [2018-01-25 02:31:40,711 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=2) [2018-01-25 02:31:41,415 INFO L259 AbstractInterpreter]: Some error location(s) were reachable [2018-01-25 02:31:41,416 INFO L268 AbstractInterpreter]: Visited 18 different actions 25 times. Merged at 7 different actions 7 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 20 variables. [2018-01-25 02:31:41,463 INFO L434 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-01-25 02:31:41,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:31:41,464 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-01-25 02:31:41,474 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:31:41,475 INFO L280 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:31:41,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:31:41,512 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:31:41,558 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-25 02:31:41,560 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:31:41,623 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:31:41,624 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 02:31:41,988 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:31:41,989 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:31:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:31:42,463 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-01-25 02:31:42,463 INFO L187 anRefinementStrategy]: Switched to InterpolantGenerator mode CVC4_IG No working directory specified, using /storage/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 Starting monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with cvc4 --tear-down-incremental --print-success --lang smt --rewrite-divk --tlimit-per=12000 [2018-01-25 02:31:42,468 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:31:42,468 INFO L280 anRefinementStrategy]: Using traceCheck mode CVC4_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-01-25 02:31:42,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:31:42,494 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-01-25 02:31:42,500 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-25 02:31:42,500 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-01-25 02:31:42,504 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-01-25 02:31:42,504 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:12, output treesize:11 [2018-01-25 02:31:42,562 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:31:42,563 INFO L314 TraceCheckSpWp]: Computing backward predicates... [2018-01-25 02:31:42,647 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-01-25 02:31:42,649 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 5 imperfect interpolant sequences. [2018-01-25 02:31:42,649 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7, 7, 7] total 18 [2018-01-25 02:31:42,649 INFO L247 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-01-25 02:31:42,650 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-01-25 02:31:42,651 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-01-25 02:31:42,651 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2018-01-25 02:31:42,651 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 13 states. [2018-01-25 02:31:43,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:31:43,067 INFO L93 Difference]: Finished difference Result 61 states and 65 transitions. [2018-01-25 02:31:43,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-01-25 02:31:43,073 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 21 [2018-01-25 02:31:43,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:31:43,074 INFO L225 Difference]: With dead ends: 61 [2018-01-25 02:31:43,074 INFO L226 Difference]: Without dead ends: 58 [2018-01-25 02:31:43,075 INFO L525 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 69 SyntacticMatches, 4 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=109, Invalid=397, Unknown=0, NotChecked=0, Total=506 [2018-01-25 02:31:43,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-01-25 02:31:43,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 50. [2018-01-25 02:31:43,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-01-25 02:31:43,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-01-25 02:31:43,088 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 21 [2018-01-25 02:31:43,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:31:43,089 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-01-25 02:31:43,089 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-01-25 02:31:43,089 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-01-25 02:31:43,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-01-25 02:31:43,090 INFO L314 BasicCegarLoop]: Found error trace [2018-01-25 02:31:43,090 INFO L322 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-25 02:31:43,091 INFO L371 AbstractCegarLoop]: === Iteration 6 === [test_funErr4RequiresViolation, test_funErr5RequiresViolation, test_funErr0RequiresViolation, test_funErr3RequiresViolation, test_funErr1RequiresViolation, test_funErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-25 02:31:43,091 INFO L82 PathProgramCache]: Analyzing trace with hash 308334376, now seen corresponding path program 1 times [2018-01-25 02:31:43,091 INFO L67 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-01-25 02:31:43,092 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:31:43,092 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-25 02:31:43,093 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-25 02:31:43,093 INFO L280 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-01-25 02:31:43,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-25 02:31:43,112 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-25 02:31:43,172 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-25 02:31:43,173 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-25 02:31:43,173 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-25 02:31:43,173 INFO L252 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-01-25 02:31:43,173 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-25 02:31:43,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-25 02:31:43,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-25 02:31:43,174 INFO L87 Difference]: Start difference. First operand 50 states and 53 transitions. Second operand 4 states. [2018-01-25 02:31:43,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-25 02:31:43,254 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2018-01-25 02:31:43,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-25 02:31:43,254 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 26 [2018-01-25 02:31:43,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-25 02:31:43,255 INFO L225 Difference]: With dead ends: 50 [2018-01-25 02:31:43,255 INFO L226 Difference]: Without dead ends: 0 [2018-01-25 02:31:43,256 INFO L525 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-25 02:31:43,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-25 02:31:43,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-25 02:31:43,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-25 02:31:43,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-25 02:31:43,256 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-01-25 02:31:43,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-25 02:31:43,256 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-25 02:31:43,256 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-25 02:31:43,257 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-25 02:31:43,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-25 02:31:43,260 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-25 02:31:44,269 WARN L146 SmtUtils]: Spent 935ms on a formula simplification. DAG size of input: 59 DAG size of output 53 [2018-01-25 02:31:45,214 WARN L146 SmtUtils]: Spent 916ms on a formula simplification. DAG size of input: 54 DAG size of output 47 [2018-01-25 02:31:45,241 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:31:45,242 INFO L397 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 02:31:45,242 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:31:45,242 INFO L397 ceAbstractionStarter]: At program point L544'''(lines 544 549) the Hoare annotation is: (let ((.cse0 (not (= (select |#valid| |test_fun_#in~a.base|) 1))) (.cse1 (not (= 0 |test_fun_#in~a.offset|))) (.cse2 (< (select |#length| |test_fun_#in~a.base|) 4)) (.cse3 (not (exists ((v_main_~array_size~5_BEFORE_CALL_4 Int)) (and (<= |test_fun_#in~N| v_main_~array_size~5_BEFORE_CALL_4) (= (* 4 v_main_~array_size~5_BEFORE_CALL_4) (select |#length| |test_fun_#in~a.base|))))))) (and (or .cse0 .cse1 (< 1 |test_fun_#in~N|) .cse2 (<= test_fun_~N 1) .cse3) (let ((.cse5 (= test_fun_~a.offset 0)) (.cse6 (= 1 (select |#valid| test_fun_~a.base))) (.cse4 (exists ((v_main_~array_size~5_BEFORE_CALL_4 Int)) (and (<= test_fun_~N v_main_~array_size~5_BEFORE_CALL_4) (= (* 4 v_main_~array_size~5_BEFORE_CALL_4) (select |#length| test_fun_~a.base)))))) (or .cse0 (and .cse4 .cse5 .cse6 (<= 1 test_fun_~i~2)) .cse1 (and (<= 4 (select |#length| test_fun_~a.base)) .cse5 .cse6 (<= |test_fun_#in~N| test_fun_~N) .cse4 (<= 0 test_fun_~i~2)) .cse2 .cse3)))) [2018-01-25 02:31:45,242 INFO L401 ceAbstractionStarter]: For program point test_funFINAL(lines 540 551) no Hoare annotation was computed. [2018-01-25 02:31:45,242 INFO L401 ceAbstractionStarter]: For program point L544''''(lines 544 549) no Hoare annotation was computed. [2018-01-25 02:31:45,242 INFO L401 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-25 02:31:45,242 INFO L401 ceAbstractionStarter]: For program point L545(lines 545 548) no Hoare annotation was computed. [2018-01-25 02:31:45,242 INFO L401 ceAbstractionStarter]: For program point L544(lines 544 549) no Hoare annotation was computed. [2018-01-25 02:31:45,242 INFO L401 ceAbstractionStarter]: For program point test_funErr5RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:31:45,243 INFO L401 ceAbstractionStarter]: For program point test_funErr1RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:31:45,243 INFO L401 ceAbstractionStarter]: For program point test_funErr2RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:31:45,243 INFO L401 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-25 02:31:45,243 INFO L397 ceAbstractionStarter]: At program point L545'''(lines 545 548) the Hoare annotation is: (let ((.cse4 (not (= (select |#valid| |test_fun_#in~a.base|) 1))) (.cse5 (not (= 0 |test_fun_#in~a.offset|))) (.cse6 (< (select |#length| |test_fun_#in~a.base|) 4)) (.cse2 (= test_fun_~i~2 0)) (.cse7 (not (exists ((v_main_~array_size~5_BEFORE_CALL_4 Int)) (and (<= |test_fun_#in~N| v_main_~array_size~5_BEFORE_CALL_4) (= (* 4 v_main_~array_size~5_BEFORE_CALL_4) (select |#length| |test_fun_#in~a.base|))))))) (and (or (let ((.cse0 (exists ((v_main_~array_size~5_BEFORE_CALL_4 Int)) (and (<= test_fun_~N v_main_~array_size~5_BEFORE_CALL_4) (= (* 4 v_main_~array_size~5_BEFORE_CALL_4) (select |#length| test_fun_~a.base))))) (.cse1 (= test_fun_~a.offset 0)) (.cse3 (= 1 (select |#valid| test_fun_~a.base)))) (or (and (<= 4 (select |#length| test_fun_~a.base)) .cse0 .cse1 .cse2 .cse3 (<= |test_fun_#in~N| test_fun_~N)) (and .cse0 .cse1 .cse3 (exists ((v_main_~array_size~5_BEFORE_CALL_4 Int)) (and (<= (+ test_fun_~i~2 1) v_main_~array_size~5_BEFORE_CALL_4) (= (* 4 v_main_~array_size~5_BEFORE_CALL_4) (select |#length| test_fun_~a.base)))) (<= 1 test_fun_~i~2)))) .cse4 .cse5 .cse6 .cse7) (or .cse4 .cse5 (< 1 |test_fun_#in~N|) .cse6 (and .cse2 (<= test_fun_~N 1)) .cse7))) [2018-01-25 02:31:45,243 INFO L401 ceAbstractionStarter]: For program point test_funEXIT(lines 540 551) no Hoare annotation was computed. [2018-01-25 02:31:45,243 INFO L401 ceAbstractionStarter]: For program point test_funErr3RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:31:45,243 INFO L404 ceAbstractionStarter]: At program point test_funENTRY(lines 540 551) the Hoare annotation is: true [2018-01-25 02:31:45,243 INFO L401 ceAbstractionStarter]: For program point L546''(line 546) no Hoare annotation was computed. [2018-01-25 02:31:45,243 INFO L401 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-25 02:31:45,243 INFO L401 ceAbstractionStarter]: For program point test_funErr4RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:31:45,244 INFO L401 ceAbstractionStarter]: For program point L544''(lines 544 549) no Hoare annotation was computed. [2018-01-25 02:31:45,244 INFO L401 ceAbstractionStarter]: For program point L546'''(line 546) no Hoare annotation was computed. [2018-01-25 02:31:45,244 INFO L401 ceAbstractionStarter]: For program point test_funErr0RequiresViolation(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:31:45,244 INFO L404 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 559) the Hoare annotation is: true [2018-01-25 02:31:45,244 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:31:45,244 INFO L404 ceAbstractionStarter]: At program point L1(lines 1 559) the Hoare annotation is: true [2018-01-25 02:31:45,244 INFO L401 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 559) no Hoare annotation was computed. [2018-01-25 02:31:45,244 INFO L401 ceAbstractionStarter]: For program point L557(line 557) no Hoare annotation was computed. [2018-01-25 02:31:45,244 INFO L401 ceAbstractionStarter]: For program point mainFINAL(lines 552 559) no Hoare annotation was computed. [2018-01-25 02:31:45,244 INFO L401 ceAbstractionStarter]: For program point L554(lines 554 556) no Hoare annotation was computed. [2018-01-25 02:31:45,245 INFO L397 ceAbstractionStarter]: At program point L558(line 558) the Hoare annotation is: (let ((.cse0 (* 4 main_~array_size~5))) (and (= .cse0 (select |#length| main_~numbers~5.base)) (= 0 main_~numbers~5.offset) (= 0 |main_#t~malloc6.offset|) (= 1 (select |#valid| main_~numbers~5.base)) (<= 1 main_~array_size~5) (= .cse0 (select |#length| |main_#t~malloc6.base|)) (= (store |#valid| |main_#t~malloc6.base| (select (store |#valid| |main_#t~malloc6.base| 0) |main_#t~malloc6.base|)) |old(#valid)|) (= 1 (select |#valid| |main_#t~malloc6.base|)))) [2018-01-25 02:31:45,245 INFO L401 ceAbstractionStarter]: For program point mainEXIT(lines 552 559) no Hoare annotation was computed. [2018-01-25 02:31:45,245 INFO L397 ceAbstractionStarter]: At program point mainENTRY(lines 552 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-25 02:31:45,245 INFO L401 ceAbstractionStarter]: For program point L557'(line 557) no Hoare annotation was computed. [2018-01-25 02:31:45,245 INFO L401 ceAbstractionStarter]: For program point L554''(lines 554 556) no Hoare annotation was computed. [2018-01-25 02:31:45,245 INFO L401 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-25 02:31:45,245 INFO L401 ceAbstractionStarter]: For program point L557''(line 557) no Hoare annotation was computed. [2018-01-25 02:31:45,245 INFO L401 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 552 559) no Hoare annotation was computed. [2018-01-25 02:31:45,255 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,256 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,257 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,257 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,258 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,258 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,258 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,258 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,259 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,259 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,260 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,261 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,262 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,262 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,262 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,267 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,267 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,267 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,268 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,268 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,268 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,269 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,269 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,269 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,269 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,270 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,270 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,270 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,270 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,271 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,271 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,271 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,271 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,275 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,276 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,276 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,276 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,277 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,277 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,277 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,277 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,278 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,279 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,279 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,279 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,282 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,283 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,284 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,284 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,284 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,284 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,285 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,285 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,285 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,286 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,286 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.01 02:31:45 BoogieIcfgContainer [2018-01-25 02:31:45,288 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-25 02:31:45,289 INFO L168 Benchmark]: Toolchain (without parser) took 8678.68 ms. Allocated memory was 300.9 MB in the beginning and 550.0 MB in the end (delta: 249.0 MB). Free memory was 259.9 MB in the beginning and 389.4 MB in the end (delta: -129.6 MB). Peak memory consumption was 119.5 MB. Max. memory is 5.3 GB. [2018-01-25 02:31:45,290 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 300.9 MB. Free memory is still 265.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-25 02:31:45,291 INFO L168 Benchmark]: CACSL2BoogieTranslator took 240.90 ms. Allocated memory is still 300.9 MB. Free memory was 259.9 MB in the beginning and 249.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:31:45,291 INFO L168 Benchmark]: Boogie Preprocessor took 35.89 ms. Allocated memory is still 300.9 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:31:45,291 INFO L168 Benchmark]: RCFGBuilder took 268.35 ms. Allocated memory is still 300.9 MB. Free memory was 247.8 MB in the beginning and 232.9 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. [2018-01-25 02:31:45,292 INFO L168 Benchmark]: TraceAbstraction took 8126.24 ms. Allocated memory was 300.9 MB in the beginning and 550.0 MB in the end (delta: 249.0 MB). Free memory was 230.9 MB in the beginning and 389.4 MB in the end (delta: -158.5 MB). Peak memory consumption was 90.5 MB. Max. memory is 5.3 GB. [2018-01-25 02:31:45,294 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.22 ms. Allocated memory is still 300.9 MB. Free memory is still 265.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 240.90 ms. Allocated memory is still 300.9 MB. Free memory was 259.9 MB in the beginning and 249.8 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 35.89 ms. Allocated memory is still 300.9 MB. Free memory was 249.8 MB in the beginning and 247.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 268.35 ms. Allocated memory is still 300.9 MB. Free memory was 247.8 MB in the beginning and 232.9 MB in the end (delta: 15.0 MB). Peak memory consumption was 15.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 8126.24 ms. Allocated memory was 300.9 MB in the beginning and 550.0 MB in the end (delta: 249.0 MB). Free memory was 230.9 MB in the beginning and 389.4 MB in the end (delta: -158.5 MB). Peak memory consumption was 90.5 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 17 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 145 LocStat_NO_SUPPORTING_DISEQUALITIES : 12 LocStat_NO_DISJUNCTIONS : -34 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 24 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 39 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 25 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 2.542011 RENAME_VARIABLES(MILLISECONDS) : 0.421399 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 2.463706 PROJECTAWAY(MILLISECONDS) : 0.347237 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.158696 DISJOIN(MILLISECONDS) : 2.634695 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.461313 ADD_EQUALITY(MILLISECONDS) : 0.068641 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.040620 #CONJOIN_DISJUNCTIVE : 37 #RENAME_VARIABLES : 61 #UNFREEZE : 0 #CONJOIN : 64 #PROJECTAWAY : 56 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 59 #ADD_EQUALITY : 39 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 - StatisticsResult: ArrayEqualityDomainStatistics #Locations : 17 LocStat_MAX_WEQGRAPH_SIZE : 2 LocStat_MAX_SIZEOF_WEQEDGELABEL : 1 LocStat_NO_SUPPORTING_EQUALITIES : 138 LocStat_NO_SUPPORTING_DISEQUALITIES : 12 LocStat_NO_DISJUNCTIONS : -34 LocStat_MAX_NO_DISJUNCTIONS : -1 #Transitions : 24 TransStat_MAX_WEQGRAPH_SIZE : 2 TransStat_MAX_SIZEOF_WEQEDGELABEL : 1 TransStat_NO_SUPPORTING_EQUALITIES : 40 TransStat_NO_SUPPORTING_DISEQUALITIES : 2 TransStat_NO_DISJUNCTIONS : 25 TransStat_MAX_NO_DISJUNCTIONS : 2 - StatisticsResult: EqConstraintFactoryStatistics CONJOIN_DISJUNCTIVE(MILLISECONDS) : 0.696584 RENAME_VARIABLES(MILLISECONDS) : 0.265748 UNFREEZE(MILLISECONDS) : 0.000000 CONJOIN(MILLISECONDS) : 0.630817 PROJECTAWAY(MILLISECONDS) : 0.303260 ADD_WEAK_EQUALITY(MILLISECONDS) : 0.619674 DISJOIN(MILLISECONDS) : 0.391742 RENAME_VARIABLES_DISJUNCTIVE(MILLISECONDS) : 0.300252 ADD_EQUALITY(MILLISECONDS) : 0.879553 DISJOIN_DISJUNCTIVE(MILLISECONDS) : 0.000000 ADD_DISEQUALITY(MILLISECONDS) : 0.015335 #CONJOIN_DISJUNCTIVE : 37 #RENAME_VARIABLES : 61 #UNFREEZE : 0 #CONJOIN : 64 #PROJECTAWAY : 56 #ADD_WEAK_EQUALITY : 3 #DISJOIN : 1 #RENAME_VARIABLES_DISJUNCTIVE : 59 #ADD_EQUALITY : 40 #DISJOIN_DISJUNCTIVE : 0 #ADD_DISEQUALITY : 1 * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,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 * 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: 552]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 7 specifications checked. All of them hold - InvariantResult [Line: 545]: Loop Invariant [2018-01-25 02:31:45,306 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,307 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,307 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,307 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,308 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,308 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,310 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,310 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,311 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,311 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,311 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,312 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,314 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,315 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,319 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,319 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,319 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,320 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,320 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,320 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,320 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,321 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,321 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,321 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,321 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,322 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,322 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,323 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,323 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,323 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: ((((((((((4 <= unknown-#length-unknown[a] && (\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: N <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a])) && a == 0) && i == 0) && 1 == \valid[a]) && \old(N) <= N) || (((((\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: N <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a]) && a == 0) && 1 == \valid[a]) && (\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: i + 1 <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a])) && 1 <= i)) || !(\valid[a] == 1)) || !(0 == a)) || unknown-#length-unknown[a] < 4) || !(\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: \old(N) <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a])) && (((((!(\valid[a] == 1) || !(0 == a)) || 1 < \old(N)) || unknown-#length-unknown[a] < 4) || (i == 0 && N <= 1)) || !(\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: \old(N) <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a])) - InvariantResult [Line: 544]: Loop Invariant [2018-01-25 02:31:45,325 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,325 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,326 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,326 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,326 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,326 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,327 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,327 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,339 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,339 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,340 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,340 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,340 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,340 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,340 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,342 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,342 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,343 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,343 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,343 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,343 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,344 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,344 WARN L343 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~array_size~5_BEFORE_CALL_4,QUANTIFIED] [2018-01-25 02:31:45,344 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,344 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,344 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,345 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,345 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,345 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-25 02:31:45,345 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((!(\valid[a] == 1) || !(0 == a)) || 1 < \old(N)) || unknown-#length-unknown[a] < 4) || N <= 1) || !(\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: \old(N) <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a])) && (((((!(\valid[a] == 1) || ((((\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: N <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a]) && a == 0) && 1 == \valid[a]) && 1 <= i)) || !(0 == a)) || (((((4 <= unknown-#length-unknown[a] && a == 0) && 1 == \valid[a]) && \old(N) <= N) && (\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: N <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a])) && 0 <= i)) || unknown-#length-unknown[a] < 4) || !(\exists v_main_~array_size~5_BEFORE_CALL_4 : int :: \old(N) <= v_main_~array_size~5_BEFORE_CALL_4 && 4 * v_main_~array_size~5_BEFORE_CALL_4 == unknown-#length-unknown[a])) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 38 locations, 7 error locations. SAFE Result, 8.0s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 1.2s AutomataDifference, 0.0s DeadEndRemovalTime, 1.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 150 SDtfs, 245 SDslu, 373 SDs, 0 SdLazy, 294 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 172 GetRequests, 110 SyntacticMatches, 7 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.8s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 18 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 11 PreInvPairs, 18 NumberOfFragments, 321 HoareAnnotationTreeSize, 11 FomulaSimplifications, 49 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 478 FormulaSimplificationTreeSizeReductionInter, 1.9s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 181 NumberOfCodeBlocks, 181 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 232 ConstructedInterpolants, 40 QuantifiedInterpolants, 40156 SizeOfPredicates, 19 NumberOfNonLiveVariables, 235 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 18/34 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, REUSE_STATISTICS: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array01-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-25_02-31-45-351.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array01-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-0-2018-01-25_02-31-45-351.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array01-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-0-2018-01-25_02-31-45-351.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array01-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-VPDomainBenchmark-1-2018-01-25_02-31-45-351.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array01-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-BenchmarkWithCounters-1-2018-01-25_02-31-45-351.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/array01-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Taipan+AI_EQ_preciseopt.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-25_02-31-45-351.csv Received shutdown request...