java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf -i ../../../trunk/examples/svcomp/memory-alloca/c.03-alloca_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-1cceb4a [2018-01-29 23:50:04,606 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-01-29 23:50:04,608 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-01-29 23:50:04,620 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-01-29 23:50:04,620 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-01-29 23:50:04,621 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-01-29 23:50:04,623 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-01-29 23:50:04,624 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-01-29 23:50:04,627 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-01-29 23:50:04,628 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-01-29 23:50:04,628 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-01-29 23:50:04,629 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-01-29 23:50:04,630 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-01-29 23:50:04,631 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-01-29 23:50:04,631 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-01-29 23:50:04,634 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-01-29 23:50:04,636 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-01-29 23:50:04,638 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-01-29 23:50:04,639 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-01-29 23:50:04,641 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-01-29 23:50:04,643 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-01-29 23:50:04,644 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-01-29 23:50:04,644 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-01-29 23:50:04,645 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-01-29 23:50:04,646 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-01-29 23:50:04,647 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-01-29 23:50:04,647 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-01-29 23:50:04,648 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-01-29 23:50:04,648 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-01-29 23:50:04,648 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-01-29 23:50:04,649 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-01-29 23:50:04,650 INFO L98 SettingsManager]: Beginning loading settings from /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/eq-bench/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf [2018-01-29 23:50:04,659 INFO L110 SettingsManager]: Loading preferences was successful [2018-01-29 23:50:04,660 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-01-29 23:50:04,661 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-01-29 23:50:04,661 INFO L133 SettingsManager]: * to procedures, called more than once=true [2018-01-29 23:50:04,661 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-01-29 23:50:04,661 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-01-29 23:50:04,661 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-01-29 23:50:04,662 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-01-29 23:50:04,662 INFO L133 SettingsManager]: * sizeof long=4 [2018-01-29 23:50:04,663 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-01-29 23:50:04,663 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-01-29 23:50:04,663 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-01-29 23:50:04,663 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-01-29 23:50:04,663 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-01-29 23:50:04,664 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-01-29 23:50:04,664 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-01-29 23:50:04,664 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-01-29 23:50:04,664 INFO L133 SettingsManager]: * sizeof long double=12 [2018-01-29 23:50:04,664 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-01-29 23:50:04,665 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-01-29 23:50:04,665 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-01-29 23:50:04,665 INFO L133 SettingsManager]: * Add additional assume for each assert=false [2018-01-29 23:50:04,665 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-01-29 23:50:04,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-01-29 23:50:04,666 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-01-29 23:50:04,666 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-01-29 23:50:04,666 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-01-29 23:50:04,666 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-01-29 23:50:04,667 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-01-29 23:50:04,667 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-01-29 23:50:04,667 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-01-29 23:50:04,667 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-01-29 23:50:04,668 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-01-29 23:50:04,668 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-01-29 23:50:04,703 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-01-29 23:50:04,717 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-01-29 23:50:04,721 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-01-29 23:50:04,722 INFO L271 PluginConnector]: Initializing CDTParser... [2018-01-29 23:50:04,723 INFO L276 PluginConnector]: CDTParser initialized [2018-01-29 23:50:04,724 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memory-alloca/c.03-alloca_true-valid-memsafety.i [2018-01-29 23:50:04,868 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-01-29 23:50:04,873 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-01-29 23:50:04,874 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-01-29 23:50:04,874 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-01-29 23:50:04,880 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-01-29 23:50:04,880 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:50:04" (1/1) ... [2018-01-29 23:50:04,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@518bd560 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:04, skipping insertion in model container [2018-01-29 23:50:04,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.01 11:50:04" (1/1) ... [2018-01-29 23:50:04,897 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:50:04,934 INFO L153 Dispatcher]: Using SV-COMP mode [2018-01-29 23:50:05,065 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:50:05,087 INFO L450 PostProcessor]: Settings: Checked method=main [2018-01-29 23:50:05,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:05 WrapperNode [2018-01-29 23:50:05,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-01-29 23:50:05,095 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-01-29 23:50:05,095 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-01-29 23:50:05,096 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-01-29 23:50:05,107 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:05" (1/1) ... [2018-01-29 23:50:05,107 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:05" (1/1) ... [2018-01-29 23:50:05,118 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:05" (1/1) ... [2018-01-29 23:50:05,118 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:05" (1/1) ... [2018-01-29 23:50:05,123 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:05" (1/1) ... [2018-01-29 23:50:05,126 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:05" (1/1) ... [2018-01-29 23:50:05,128 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:05" (1/1) ... [2018-01-29 23:50:05,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-01-29 23:50:05,131 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-01-29 23:50:05,131 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-01-29 23:50:05,131 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-01-29 23:50:05,132 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:05" (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-29 23:50:05,190 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-01-29 23:50:05,190 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-01-29 23:50:05,190 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-01-29 23:50:05,190 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-01-29 23:50:05,190 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-01-29 23:50:05,190 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-01-29 23:50:05,190 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-01-29 23:50:05,190 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-01-29 23:50:05,190 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-01-29 23:50:05,191 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-01-29 23:50:05,191 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-01-29 23:50:05,191 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-01-29 23:50:05,191 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-01-29 23:50:05,191 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-01-29 23:50:05,560 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-01-29 23:50:05,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:50:05 BoogieIcfgContainer [2018-01-29 23:50:05,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-01-29 23:50:05,562 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-01-29 23:50:05,562 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-01-29 23:50:05,565 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-01-29 23:50:05,565 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.01 11:50:04" (1/3) ... [2018-01-29 23:50:05,566 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f4cc9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:50:05, skipping insertion in model container [2018-01-29 23:50:05,566 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.01 11:50:05" (2/3) ... [2018-01-29 23:50:05,567 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27f4cc9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.01 11:50:05, skipping insertion in model container [2018-01-29 23:50:05,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.01 11:50:05" (3/3) ... [2018-01-29 23:50:05,569 INFO L107 eAbstractionObserver]: Analyzing ICFG c.03-alloca_true-valid-memsafety.i [2018-01-29 23:50:05,577 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-01-29 23:50:05,585 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-01-29 23:50:05,630 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-01-29 23:50:05,630 INFO L323 AbstractCegarLoop]: Hoare is true [2018-01-29 23:50:05,631 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-01-29 23:50:05,631 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-01-29 23:50:05,631 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-01-29 23:50:05,631 INFO L327 AbstractCegarLoop]: Difference is false [2018-01-29 23:50:05,631 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-01-29 23:50:05,631 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-01-29 23:50:05,632 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-01-29 23:50:05,653 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states. [2018-01-29 23:50:05,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-01-29 23:50:05,660 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:05,661 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:05,661 INFO L371 AbstractCegarLoop]: === Iteration 1 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 23:50:05,666 INFO L82 PathProgramCache]: Analyzing trace with hash 681865895, now seen corresponding path program 1 times [2018-01-29 23:50:05,668 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:05,669 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:05,714 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:05,715 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:05,715 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:05,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:05,791 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:06,014 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-29 23:50:06,017 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:50:06,017 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:50:06,019 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:50:06,029 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:50:06,029 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:50:06,031 INFO L87 Difference]: Start difference. First operand 103 states. Second operand 5 states. [2018-01-29 23:50:06,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:06,288 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2018-01-29 23:50:06,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:50:06,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-01-29 23:50:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:06,302 INFO L225 Difference]: With dead ends: 129 [2018-01-29 23:50:06,303 INFO L226 Difference]: Without dead ends: 90 [2018-01-29 23:50:06,306 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:50:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-01-29 23:50:06,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2018-01-29 23:50:06,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-01-29 23:50:06,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-01-29 23:50:06,348 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 22 [2018-01-29 23:50:06,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:06,348 INFO L432 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-01-29 23:50:06,348 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:50:06,349 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-01-29 23:50:06,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-29 23:50:06,349 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:06,350 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:06,350 INFO L371 AbstractCegarLoop]: === Iteration 2 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 23:50:06,350 INFO L82 PathProgramCache]: Analyzing trace with hash -336993779, now seen corresponding path program 1 times [2018-01-29 23:50:06,350 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:06,350 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:06,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:06,351 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:06,351 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:06,372 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:06,432 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-29 23:50:06,432 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:50:06,432 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:50:06,433 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:50:06,434 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:50:06,434 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:50:06,434 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 4 states. [2018-01-29 23:50:06,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:06,529 INFO L93 Difference]: Finished difference Result 90 states and 91 transitions. [2018-01-29 23:50:06,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:50:06,530 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2018-01-29 23:50:06,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:06,531 INFO L225 Difference]: With dead ends: 90 [2018-01-29 23:50:06,531 INFO L226 Difference]: Without dead ends: 88 [2018-01-29 23:50:06,532 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:50:06,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-01-29 23:50:06,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2018-01-29 23:50:06,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-01-29 23:50:06,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 89 transitions. [2018-01-29 23:50:06,538 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 89 transitions. Word has length 23 [2018-01-29 23:50:06,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:06,539 INFO L432 AbstractCegarLoop]: Abstraction has 88 states and 89 transitions. [2018-01-29 23:50:06,539 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:50:06,539 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 89 transitions. [2018-01-29 23:50:06,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-01-29 23:50:06,539 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:06,539 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:06,539 INFO L371 AbstractCegarLoop]: === Iteration 3 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 23:50:06,540 INFO L82 PathProgramCache]: Analyzing trace with hash -336993778, now seen corresponding path program 1 times [2018-01-29 23:50:06,540 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:06,540 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:06,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:06,541 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:06,541 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:06,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:06,562 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:06,652 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-29 23:50:06,653 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:50:06,653 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-01-29 23:50:06,653 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-01-29 23:50:06,654 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-01-29 23:50:06,654 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:50:06,654 INFO L87 Difference]: Start difference. First operand 88 states and 89 transitions. Second operand 5 states. [2018-01-29 23:50:06,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:06,739 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2018-01-29 23:50:06,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:50:06,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 23 [2018-01-29 23:50:06,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:06,741 INFO L225 Difference]: With dead ends: 88 [2018-01-29 23:50:06,741 INFO L226 Difference]: Without dead ends: 86 [2018-01-29 23:50:06,741 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-01-29 23:50:06,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-01-29 23:50:06,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2018-01-29 23:50:06,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-01-29 23:50:06,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 87 transitions. [2018-01-29 23:50:06,748 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 87 transitions. Word has length 23 [2018-01-29 23:50:06,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:06,748 INFO L432 AbstractCegarLoop]: Abstraction has 86 states and 87 transitions. [2018-01-29 23:50:06,748 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-01-29 23:50:06,749 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 87 transitions. [2018-01-29 23:50:06,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-29 23:50:06,749 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:06,749 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:06,749 INFO L371 AbstractCegarLoop]: === Iteration 4 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 23:50:06,749 INFO L82 PathProgramCache]: Analyzing trace with hash -1856872567, now seen corresponding path program 1 times [2018-01-29 23:50:06,750 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:06,750 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:06,750 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:06,751 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:06,751 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:06,766 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:06,834 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-29 23:50:06,834 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:50:06,834 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:50:06,835 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:50:06,835 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:50:06,835 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:50:06,836 INFO L87 Difference]: Start difference. First operand 86 states and 87 transitions. Second operand 4 states. [2018-01-29 23:50:06,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:06,907 INFO L93 Difference]: Finished difference Result 86 states and 87 transitions. [2018-01-29 23:50:06,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:50:06,907 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-29 23:50:06,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:06,908 INFO L225 Difference]: With dead ends: 86 [2018-01-29 23:50:06,908 INFO L226 Difference]: Without dead ends: 82 [2018-01-29 23:50:06,909 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:50:06,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-01-29 23:50:06,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2018-01-29 23:50:06,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-01-29 23:50:06,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 83 transitions. [2018-01-29 23:50:06,915 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 83 transitions. Word has length 24 [2018-01-29 23:50:06,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:06,915 INFO L432 AbstractCegarLoop]: Abstraction has 82 states and 83 transitions. [2018-01-29 23:50:06,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:50:06,915 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 83 transitions. [2018-01-29 23:50:06,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-01-29 23:50:06,916 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:06,916 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:06,916 INFO L371 AbstractCegarLoop]: === Iteration 5 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 23:50:06,916 INFO L82 PathProgramCache]: Analyzing trace with hash -1856872566, now seen corresponding path program 1 times [2018-01-29 23:50:06,916 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:06,916 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:06,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:06,917 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:06,917 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:06,933 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:06,989 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-29 23:50:06,989 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:50:06,989 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:50:06,990 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:50:06,990 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:50:06,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:50:06,990 INFO L87 Difference]: Start difference. First operand 82 states and 83 transitions. Second operand 4 states. [2018-01-29 23:50:07,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:07,057 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-01-29 23:50:07,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:50:07,057 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2018-01-29 23:50:07,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:07,058 INFO L225 Difference]: With dead ends: 82 [2018-01-29 23:50:07,058 INFO L226 Difference]: Without dead ends: 78 [2018-01-29 23:50:07,058 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-01-29 23:50:07,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-01-29 23:50:07,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-01-29 23:50:07,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-01-29 23:50:07,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-01-29 23:50:07,064 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 24 [2018-01-29 23:50:07,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:07,064 INFO L432 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-01-29 23:50:07,064 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:50:07,064 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-01-29 23:50:07,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-29 23:50:07,066 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:07,066 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:07,066 INFO L371 AbstractCegarLoop]: === Iteration 6 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 23:50:07,066 INFO L82 PathProgramCache]: Analyzing trace with hash -1728474736, now seen corresponding path program 1 times [2018-01-29 23:50:07,066 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:07,066 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:07,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:07,067 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:07,067 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:07,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:07,081 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:07,134 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-29 23:50:07,134 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:50:07,135 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:50:07,135 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:50:07,135 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:50:07,136 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:50:07,136 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 4 states. [2018-01-29 23:50:07,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:07,223 INFO L93 Difference]: Finished difference Result 78 states and 79 transitions. [2018-01-29 23:50:07,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-01-29 23:50:07,223 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-29 23:50:07,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:07,224 INFO L225 Difference]: With dead ends: 78 [2018-01-29 23:50:07,225 INFO L226 Difference]: Without dead ends: 74 [2018-01-29 23:50:07,225 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-29 23:50:07,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-01-29 23:50:07,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2018-01-29 23:50:07,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-01-29 23:50:07,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 75 transitions. [2018-01-29 23:50:07,232 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 75 transitions. Word has length 25 [2018-01-29 23:50:07,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:07,232 INFO L432 AbstractCegarLoop]: Abstraction has 74 states and 75 transitions. [2018-01-29 23:50:07,232 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:50:07,233 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 75 transitions. [2018-01-29 23:50:07,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-01-29 23:50:07,233 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:07,234 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:07,234 INFO L371 AbstractCegarLoop]: === Iteration 7 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 23:50:07,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1728474735, now seen corresponding path program 1 times [2018-01-29 23:50:07,234 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:07,234 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:07,235 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:07,235 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:07,236 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:07,249 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:07,299 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-29 23:50:07,300 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:50:07,300 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-01-29 23:50:07,300 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-01-29 23:50:07,300 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-01-29 23:50:07,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-01-29 23:50:07,301 INFO L87 Difference]: Start difference. First operand 74 states and 75 transitions. Second operand 4 states. [2018-01-29 23:50:07,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:07,347 INFO L93 Difference]: Finished difference Result 74 states and 75 transitions. [2018-01-29 23:50:07,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-01-29 23:50:07,347 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-01-29 23:50:07,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:07,348 INFO L225 Difference]: With dead ends: 74 [2018-01-29 23:50:07,348 INFO L226 Difference]: Without dead ends: 70 [2018-01-29 23:50:07,348 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-29 23:50:07,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-01-29 23:50:07,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-01-29 23:50:07,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-01-29 23:50:07,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2018-01-29 23:50:07,354 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 25 [2018-01-29 23:50:07,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:07,354 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2018-01-29 23:50:07,354 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-01-29 23:50:07,354 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2018-01-29 23:50:07,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-01-29 23:50:07,355 INFO L342 BasicCegarLoop]: Found error trace [2018-01-29 23:50:07,355 INFO L350 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-01-29 23:50:07,355 INFO L371 AbstractCegarLoop]: === Iteration 8 === [test_funErr27RequiresViolation, test_funErr17RequiresViolation, test_funErr4RequiresViolation, test_funErr7RequiresViolation, test_funErr12RequiresViolation, test_funErr9RequiresViolation, test_funErr14RequiresViolation, test_funErr22RequiresViolation, test_funErr2RequiresViolation, test_funErr19RequiresViolation, test_funErr6RequiresViolation, test_funErr20RequiresViolation, test_funErr29RequiresViolation, test_funErr16RequiresViolation, test_funErr3RequiresViolation, test_funErr26RequiresViolation, test_funErr8RequiresViolation, test_funErr13RequiresViolation, test_funErr23RequiresViolation, test_funErr5RequiresViolation, test_funErr10RequiresViolation, test_funErr0RequiresViolation, test_funErr11RequiresViolation, test_funErr24RequiresViolation, test_funErr15RequiresViolation, test_funErr25RequiresViolation, test_funErr28RequiresViolation, test_funErr1RequiresViolation, test_funErr18RequiresViolation, test_funErr21RequiresViolation, mainErr0EnsuresViolation]=== [2018-01-29 23:50:07,356 INFO L82 PathProgramCache]: Analyzing trace with hash -860535818, now seen corresponding path program 1 times [2018-01-29 23:50:07,356 INFO L209 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-01-29 23:50:07,356 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-01-29 23:50:07,356 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:07,356 INFO L101 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-01-29 23:50:07,357 INFO L117 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-01-29 23:50:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-01-29 23:50:07,383 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-01-29 23:50:08,062 WARN L146 SmtUtils]: Spent 112ms on a formula simplification. DAG size of input: 63 DAG size of output 40 [2018-01-29 23:50:08,344 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-29 23:50:08,344 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-01-29 23:50:08,344 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-01-29 23:50:08,345 INFO L409 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-01-29 23:50:08,345 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-01-29 23:50:08,345 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-01-29 23:50:08,345 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand 11 states. [2018-01-29 23:50:08,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-01-29 23:50:08,779 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-01-29 23:50:08,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-01-29 23:50:08,780 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 51 [2018-01-29 23:50:08,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-01-29 23:50:08,780 INFO L225 Difference]: With dead ends: 70 [2018-01-29 23:50:08,780 INFO L226 Difference]: Without dead ends: 0 [2018-01-29 23:50:08,781 INFO L553 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2018-01-29 23:50:08,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-01-29 23:50:08,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-01-29 23:50:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-01-29 23:50:08,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-01-29 23:50:08,782 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 51 [2018-01-29 23:50:08,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-01-29 23:50:08,783 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-01-29 23:50:08,783 INFO L433 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-01-29 23:50:08,783 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-01-29 23:50:08,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-01-29 23:50:08,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-01-29 23:50:09,033 WARN L146 SmtUtils]: Spent 208ms on a formula simplification. DAG size of input: 94 DAG size of output 93 [2018-01-29 23:50:09,037 INFO L399 ceAbstractionStarter]: For program point L1(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,038 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,038 INFO L395 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(lines 1 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 23:50:09,038 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,038 INFO L395 ceAbstractionStarter]: At program point L550''''''''(lines 550 557) the Hoare annotation is: (let ((.cse0 (store |#valid| |test_fun_#t~malloc0.base| 0))) (let ((.cse1 (select .cse0 |test_fun_#t~malloc0.base|))) (and (not (= |test_fun_#t~malloc1.base| |test_fun_#t~malloc3.base|)) (= (select |old(#valid)| |test_fun_#t~malloc3.base|) 0) (= 0 |test_fun_#t~malloc0.offset|) (= 1 (select |#valid| |test_fun_#t~malloc3.base|)) (not (= |test_fun_#t~malloc2.base| |test_fun_#t~malloc3.base|)) (= 4 (select |#length| |test_fun_#t~malloc0.base|)) (= (select |old(#valid)| |test_fun_#t~malloc1.base|) 0) (= 4 (select |#length| test_fun_~x_ref~2.base)) (= 4 (select |#length| |test_fun_#t~malloc2.base|)) (= .cse0 (store (store (store (store |old(#valid)| |test_fun_#t~malloc1.base| (select .cse0 |test_fun_#t~malloc1.base|)) |test_fun_#t~malloc2.base| (select .cse0 |test_fun_#t~malloc2.base|)) |test_fun_#t~malloc0.base| .cse1) |test_fun_#t~malloc3.base| (select .cse0 |test_fun_#t~malloc3.base|))) (= test_fun_~c~2.offset 0) (= 4 (select |#length| |test_fun_#t~malloc1.base|)) (= (select |old(#valid)| |test_fun_#t~malloc2.base|) 0) (not (= |test_fun_#t~malloc0.base| |test_fun_#t~malloc1.base|)) (= (select |old(#valid)| |test_fun_#t~malloc0.base|) .cse1) (= 0 |test_fun_#t~malloc3.offset|) (= 1 (select |#valid| test_fun_~z_ref~2.base)) (= (select |#valid| |test_fun_#t~malloc0.base|) 1) (= (select |#valid| test_fun_~y_ref~2.base) 1) (= 4 (select |#length| test_fun_~y_ref~2.base)) (= test_fun_~x_ref~2.offset 0) (= 1 (select |#valid| test_fun_~c~2.base)) (= 1 (select |#valid| |test_fun_#t~malloc2.base|)) (= (select |#length| test_fun_~c~2.base) 4) (= (select |#valid| test_fun_~x_ref~2.base) 1) (= 4 (select |#length| test_fun_~z_ref~2.base)) (not (= |test_fun_#t~malloc1.base| |test_fun_#t~malloc2.base|)) (= 0 |test_fun_#t~malloc2.offset|) (= test_fun_~z_ref~2.offset 0) (= test_fun_~y_ref~2.offset 0) (not (= |test_fun_#t~malloc0.base| |test_fun_#t~malloc2.base|)) (= 4 (select |#length| |test_fun_#t~malloc3.base|)) (= 0 |test_fun_#t~malloc1.offset|) (not (= |test_fun_#t~malloc0.base| |test_fun_#t~malloc3.base|)) (= 1 (select |#valid| |test_fun_#t~malloc1.base|))))) [2018-01-29 23:50:09,038 INFO L399 ceAbstractionStarter]: For program point L542(line 542) no Hoare annotation was computed. [2018-01-29 23:50:09,038 INFO L399 ceAbstractionStarter]: For program point test_funErr6RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,039 INFO L399 ceAbstractionStarter]: For program point test_funErr12RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,039 INFO L399 ceAbstractionStarter]: For program point test_funErr21RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,039 INFO L399 ceAbstractionStarter]: For program point L540(lines 540 559) no Hoare annotation was computed. [2018-01-29 23:50:09,039 INFO L399 ceAbstractionStarter]: For program point L546(line 546) no Hoare annotation was computed. [2018-01-29 23:50:09,039 INFO L399 ceAbstractionStarter]: For program point test_funErr20RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,039 INFO L399 ceAbstractionStarter]: For program point L545(line 545) no Hoare annotation was computed. [2018-01-29 23:50:09,039 INFO L399 ceAbstractionStarter]: For program point L544(line 544) no Hoare annotation was computed. [2018-01-29 23:50:09,039 INFO L399 ceAbstractionStarter]: For program point L543(line 543) no Hoare annotation was computed. [2018-01-29 23:50:09,039 INFO L399 ceAbstractionStarter]: For program point test_funErr5RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,039 INFO L399 ceAbstractionStarter]: For program point L548(line 548) no Hoare annotation was computed. [2018-01-29 23:50:09,039 INFO L399 ceAbstractionStarter]: For program point L547(line 547) no Hoare annotation was computed. [2018-01-29 23:50:09,039 INFO L399 ceAbstractionStarter]: For program point test_funErr7RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,039 INFO L399 ceAbstractionStarter]: For program point test_funErr11RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,040 INFO L399 ceAbstractionStarter]: For program point L552''(line 552) no Hoare annotation was computed. [2018-01-29 23:50:09,040 INFO L399 ceAbstractionStarter]: For program point L550''(line 550) no Hoare annotation was computed. [2018-01-29 23:50:09,040 INFO L399 ceAbstractionStarter]: For program point L550'''''''(line 550) no Hoare annotation was computed. [2018-01-29 23:50:09,040 INFO L399 ceAbstractionStarter]: For program point L551'''''''(line 551) no Hoare annotation was computed. [2018-01-29 23:50:09,040 INFO L399 ceAbstractionStarter]: For program point L554'(line 554) no Hoare annotation was computed. [2018-01-29 23:50:09,040 INFO L399 ceAbstractionStarter]: For program point L546'(line 546) no Hoare annotation was computed. [2018-01-29 23:50:09,040 INFO L399 ceAbstractionStarter]: For program point L554''(line 554) no Hoare annotation was computed. [2018-01-29 23:50:09,040 INFO L399 ceAbstractionStarter]: For program point L558'(line 558) no Hoare annotation was computed. [2018-01-29 23:50:09,040 INFO L399 ceAbstractionStarter]: For program point L543'''(line 543) no Hoare annotation was computed. [2018-01-29 23:50:09,040 INFO L399 ceAbstractionStarter]: For program point test_funErr28RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,040 INFO L399 ceAbstractionStarter]: For program point L550'(line 550) no Hoare annotation was computed. [2018-01-29 23:50:09,040 INFO L399 ceAbstractionStarter]: For program point test_funErr8RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,040 INFO L399 ceAbstractionStarter]: For program point L542'(line 542) no Hoare annotation was computed. [2018-01-29 23:50:09,041 INFO L399 ceAbstractionStarter]: For program point test_funErr14RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,041 INFO L399 ceAbstractionStarter]: For program point test_funEXIT(lines 540 559) no Hoare annotation was computed. [2018-01-29 23:50:09,041 INFO L399 ceAbstractionStarter]: For program point test_funErr3RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,041 INFO L399 ceAbstractionStarter]: For program point L551'''(line 551) no Hoare annotation was computed. [2018-01-29 23:50:09,041 INFO L399 ceAbstractionStarter]: For program point L550''''(line 550) no Hoare annotation was computed. [2018-01-29 23:50:09,041 INFO L395 ceAbstractionStarter]: At program point test_funENTRY(lines 540 559) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 23:50:09,041 INFO L399 ceAbstractionStarter]: For program point test_funErr22RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,041 INFO L399 ceAbstractionStarter]: For program point L543'(line 543) no Hoare annotation was computed. [2018-01-29 23:50:09,041 INFO L399 ceAbstractionStarter]: For program point L545''(line 545) no Hoare annotation was computed. [2018-01-29 23:50:09,041 INFO L399 ceAbstractionStarter]: For program point L543''(line 543) no Hoare annotation was computed. [2018-01-29 23:50:09,041 INFO L399 ceAbstractionStarter]: For program point L551''''(line 551) no Hoare annotation was computed. [2018-01-29 23:50:09,041 INFO L399 ceAbstractionStarter]: For program point L550'''''''''(lines 550 557) no Hoare annotation was computed. [2018-01-29 23:50:09,041 INFO L399 ceAbstractionStarter]: For program point test_funErr0RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,042 INFO L399 ceAbstractionStarter]: For program point test_funErr17RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,042 INFO L399 ceAbstractionStarter]: For program point L544'''(line 544) no Hoare annotation was computed. [2018-01-29 23:50:09,042 INFO L399 ceAbstractionStarter]: For program point test_funFINAL(lines 540 559) no Hoare annotation was computed. [2018-01-29 23:50:09,042 INFO L399 ceAbstractionStarter]: For program point L551'(line 551) no Hoare annotation was computed. [2018-01-29 23:50:09,042 INFO L399 ceAbstractionStarter]: For program point test_funErr25RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,042 INFO L399 ceAbstractionStarter]: For program point L550'''(line 550) no Hoare annotation was computed. [2018-01-29 23:50:09,042 INFO L399 ceAbstractionStarter]: For program point L551''''''(line 551) no Hoare annotation was computed. [2018-01-29 23:50:09,042 INFO L399 ceAbstractionStarter]: For program point L551''''''''(lines 551 555) no Hoare annotation was computed. [2018-01-29 23:50:09,042 INFO L399 ceAbstractionStarter]: For program point test_funErr1RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,042 INFO L399 ceAbstractionStarter]: For program point test_funErr18RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,042 INFO L399 ceAbstractionStarter]: For program point test_funErr2RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,042 INFO L399 ceAbstractionStarter]: For program point L551''(line 551) no Hoare annotation was computed. [2018-01-29 23:50:09,042 INFO L399 ceAbstractionStarter]: For program point test_funErr27RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,042 INFO L399 ceAbstractionStarter]: For program point test_funErr24RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,043 INFO L399 ceAbstractionStarter]: For program point test_funErr19RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,043 INFO L399 ceAbstractionStarter]: For program point L544'(line 544) no Hoare annotation was computed. [2018-01-29 23:50:09,043 INFO L399 ceAbstractionStarter]: For program point L556'(line 556) no Hoare annotation was computed. [2018-01-29 23:50:09,043 INFO L399 ceAbstractionStarter]: For program point test_funErr15RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,043 INFO L399 ceAbstractionStarter]: For program point test_funErr10RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,043 INFO L399 ceAbstractionStarter]: For program point L550''''''(line 550) no Hoare annotation was computed. [2018-01-29 23:50:09,043 INFO L399 ceAbstractionStarter]: For program point L545'''(line 545) no Hoare annotation was computed. [2018-01-29 23:50:09,043 INFO L399 ceAbstractionStarter]: For program point L540'(lines 540 559) no Hoare annotation was computed. [2018-01-29 23:50:09,043 INFO L399 ceAbstractionStarter]: For program point L552(line 552) no Hoare annotation was computed. [2018-01-29 23:50:09,043 INFO L399 ceAbstractionStarter]: For program point L551(line 551) no Hoare annotation was computed. [2018-01-29 23:50:09,043 INFO L399 ceAbstractionStarter]: For program point L552'(line 552) no Hoare annotation was computed. [2018-01-29 23:50:09,043 INFO L399 ceAbstractionStarter]: For program point L550(lines 550 557) no Hoare annotation was computed. [2018-01-29 23:50:09,043 INFO L399 ceAbstractionStarter]: For program point test_funErr23RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,044 INFO L399 ceAbstractionStarter]: For program point L556(line 556) no Hoare annotation was computed. [2018-01-29 23:50:09,044 INFO L399 ceAbstractionStarter]: For program point L554(line 554) no Hoare annotation was computed. [2018-01-29 23:50:09,044 INFO L399 ceAbstractionStarter]: For program point L558(line 558) no Hoare annotation was computed. [2018-01-29 23:50:09,044 INFO L399 ceAbstractionStarter]: For program point test_funErr16RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,044 INFO L399 ceAbstractionStarter]: For program point test_funErr29RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,044 INFO L399 ceAbstractionStarter]: For program point L542''(line 542) no Hoare annotation was computed. [2018-01-29 23:50:09,044 INFO L399 ceAbstractionStarter]: For program point test_funErr9RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,044 INFO L399 ceAbstractionStarter]: For program point test_funErr26RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,044 INFO L399 ceAbstractionStarter]: For program point L545'(line 545) no Hoare annotation was computed. [2018-01-29 23:50:09,044 INFO L399 ceAbstractionStarter]: For program point test_funErr4RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,044 INFO L399 ceAbstractionStarter]: For program point L544''(line 544) no Hoare annotation was computed. [2018-01-29 23:50:09,045 INFO L399 ceAbstractionStarter]: For program point test_funErr13RequiresViolation(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,045 INFO L399 ceAbstractionStarter]: For program point L542'''(line 542) no Hoare annotation was computed. [2018-01-29 23:50:09,045 INFO L402 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(lines 1 562) the Hoare annotation is: true [2018-01-29 23:50:09,045 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,045 INFO L402 ceAbstractionStarter]: At program point L1(lines 1 562) the Hoare annotation is: true [2018-01-29 23:50:09,045 INFO L399 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(lines 1 562) no Hoare annotation was computed. [2018-01-29 23:50:09,045 INFO L399 ceAbstractionStarter]: For program point L561'(line 561) no Hoare annotation was computed. [2018-01-29 23:50:09,045 INFO L399 ceAbstractionStarter]: For program point L561(line 561) no Hoare annotation was computed. [2018-01-29 23:50:09,045 INFO L399 ceAbstractionStarter]: For program point mainFINAL(lines 560 562) no Hoare annotation was computed. [2018-01-29 23:50:09,045 INFO L399 ceAbstractionStarter]: For program point L561''''(line 561) no Hoare annotation was computed. [2018-01-29 23:50:09,045 INFO L399 ceAbstractionStarter]: For program point L561''''''(line 561) no Hoare annotation was computed. [2018-01-29 23:50:09,045 INFO L399 ceAbstractionStarter]: For program point mainEXIT(lines 560 562) no Hoare annotation was computed. [2018-01-29 23:50:09,045 INFO L395 ceAbstractionStarter]: At program point mainENTRY(lines 560 562) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 23:50:09,046 INFO L395 ceAbstractionStarter]: At program point L561''(line 561) the Hoare annotation is: (= |#valid| |old(#valid)|) [2018-01-29 23:50:09,046 INFO L399 ceAbstractionStarter]: For program point L561'''''(line 561) no Hoare annotation was computed. [2018-01-29 23:50:09,046 INFO L399 ceAbstractionStarter]: For program point L561''''''''(line 561) no Hoare annotation was computed. [2018-01-29 23:50:09,046 INFO L399 ceAbstractionStarter]: For program point L561'''(line 561) no Hoare annotation was computed. [2018-01-29 23:50:09,046 INFO L399 ceAbstractionStarter]: For program point L561'''''''(line 561) no Hoare annotation was computed. [2018-01-29 23:50:09,046 INFO L399 ceAbstractionStarter]: For program point mainErr0EnsuresViolation(lines 560 562) no Hoare annotation was computed. [2018-01-29 23:50:09,055 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,056 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,056 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,057 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,057 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,057 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,058 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,058 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,064 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,064 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,065 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,066 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,068 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.01 11:50:09 BoogieIcfgContainer [2018-01-29 23:50:09,068 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-01-29 23:50:09,069 INFO L168 Benchmark]: Toolchain (without parser) took 4200.63 ms. Allocated memory was 303.6 MB in the beginning and 518.5 MB in the end (delta: 215.0 MB). Free memory was 260.3 MB in the beginning and 425.1 MB in the end (delta: -164.8 MB). Peak memory consumption was 50.1 MB. Max. memory is 5.3 GB. [2018-01-29 23:50:09,070 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 303.6 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-01-29 23:50:09,070 INFO L168 Benchmark]: CACSL2BoogieTranslator took 221.47 ms. Allocated memory is still 303.6 MB. Free memory was 260.3 MB in the beginning and 250.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:50:09,070 INFO L168 Benchmark]: Boogie Preprocessor took 34.89 ms. Allocated memory is still 303.6 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:50:09,071 INFO L168 Benchmark]: RCFGBuilder took 430.49 ms. Allocated memory is still 303.6 MB. Free memory was 248.3 MB in the beginning and 223.3 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. [2018-01-29 23:50:09,071 INFO L168 Benchmark]: TraceAbstraction took 3506.40 ms. Allocated memory was 303.6 MB in the beginning and 518.5 MB in the end (delta: 215.0 MB). Free memory was 223.3 MB in the beginning and 425.1 MB in the end (delta: -201.8 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. [2018-01-29 23:50:09,072 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.20 ms. Allocated memory is still 303.6 MB. Free memory is still 266.3 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 221.47 ms. Allocated memory is still 303.6 MB. Free memory was 260.3 MB in the beginning and 250.3 MB in the end (delta: 10.0 MB). Peak memory consumption was 10.0 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 34.89 ms. Allocated memory is still 303.6 MB. Free memory was 250.3 MB in the beginning and 248.3 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 5.3 GB. * RCFGBuilder took 430.49 ms. Allocated memory is still 303.6 MB. Free memory was 248.3 MB in the beginning and 223.3 MB in the end (delta: 25.0 MB). Peak memory consumption was 25.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 3506.40 ms. Allocated memory was 303.6 MB in the beginning and 518.5 MB in the end (delta: 215.0 MB). Free memory was 223.3 MB in the beginning and 425.1 MB in the end (delta: -201.8 MB). Peak memory consumption was 13.1 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length - GenericResult: Unfinished Backtranslation unknown boogie variable #length * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 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: 560]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 31 specifications checked. All of them hold - InvariantResult [Line: 550]: Loop Invariant [2018-01-29 23:50:09,079 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,079 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,080 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,080 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,080 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,080 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,081 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,081 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,084 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,084 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,085 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,085 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,085 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,085 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,086 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length [2018-01-29 23:50:09,086 WARN L1215 BoogieBacktranslator]: unknown boogie variable #length Derived loop invariant: (((((((((((((((((((((((((((((((((!(__builtin_alloca (sizeof(int)) == __builtin_alloca (sizeof(int))) && \old(\valid)[__builtin_alloca (sizeof(int))] == 0) && 0 == __builtin_alloca (sizeof(int))) && 1 == \valid[__builtin_alloca (sizeof(int))]) && !(__builtin_alloca (sizeof(int)) == __builtin_alloca (sizeof(int)))) && 4 == unknown-#length-unknown[__builtin_alloca (sizeof(int))]) && \old(\valid)[__builtin_alloca (sizeof(int))] == 0) && 4 == unknown-#length-unknown[x_ref]) && 4 == unknown-#length-unknown[__builtin_alloca (sizeof(int))]) && \valid[__builtin_alloca (sizeof(int)) := 0] == \old(\valid)[__builtin_alloca (sizeof(int)) := \valid[__builtin_alloca (sizeof(int)) := 0][__builtin_alloca (sizeof(int))]][__builtin_alloca (sizeof(int)) := \valid[__builtin_alloca (sizeof(int)) := 0][__builtin_alloca (sizeof(int))]][__builtin_alloca (sizeof(int)) := \valid[__builtin_alloca (sizeof(int)) := 0][__builtin_alloca (sizeof(int))]][__builtin_alloca (sizeof(int)) := \valid[__builtin_alloca (sizeof(int)) := 0][__builtin_alloca (sizeof(int))]]) && c == 0) && 4 == unknown-#length-unknown[__builtin_alloca (sizeof(int))]) && \old(\valid)[__builtin_alloca (sizeof(int))] == 0) && !(__builtin_alloca (sizeof(int)) == __builtin_alloca (sizeof(int)))) && \old(\valid)[__builtin_alloca (sizeof(int))] == \valid[__builtin_alloca (sizeof(int)) := 0][__builtin_alloca (sizeof(int))]) && 0 == __builtin_alloca (sizeof(int))) && 1 == \valid[z_ref]) && \valid[__builtin_alloca (sizeof(int))] == 1) && \valid[y_ref] == 1) && 4 == unknown-#length-unknown[y_ref]) && x_ref == 0) && 1 == \valid[c]) && 1 == \valid[__builtin_alloca (sizeof(int))]) && unknown-#length-unknown[c] == 4) && \valid[x_ref] == 1) && 4 == unknown-#length-unknown[z_ref]) && !(__builtin_alloca (sizeof(int)) == __builtin_alloca (sizeof(int)))) && 0 == __builtin_alloca (sizeof(int))) && z_ref == 0) && y_ref == 0) && !(__builtin_alloca (sizeof(int)) == __builtin_alloca (sizeof(int)))) && 4 == unknown-#length-unknown[__builtin_alloca (sizeof(int))]) && 0 == __builtin_alloca (sizeof(int))) && !(__builtin_alloca (sizeof(int)) == __builtin_alloca (sizeof(int)))) && 1 == \valid[__builtin_alloca (sizeof(int))] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 103 locations, 31 error locations. SAFE Result, 3.4s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.2s HoareAnnotationTime, HoareTripleCheckerStatistics: 429 SDtfs, 696 SDslu, 639 SDs, 0 SdLazy, 570 SolverSat, 46 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 58 GetRequests, 13 SyntacticMatches, 9 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=103occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 7 NumberOfFragments, 206 HoareAnnotationTreeSize, 7 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 5 FormulaSimplificationTreeSizeReductionInter, 0.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 217 NumberOfCodeBlocks, 217 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 117437 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/c.03-alloca_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-Benchmark-0-2018-01-29_23-50-09-090.csv Written .csv to /storage/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/c.03-alloca_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel+AI_EQ_SS.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-01-29_23-50-09-090.csv Received shutdown request...