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/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/memory-alloca/c.03-alloca_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ccafca9-m [2018-02-04 00:17:24,685 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 00:17:24,686 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 00:17:24,696 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 00:17:24,696 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 00:17:24,696 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 00:17:24,697 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 00:17:24,698 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 00:17:24,700 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 00:17:24,700 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 00:17:24,701 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 00:17:24,701 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 00:17:24,702 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 00:17:24,703 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 00:17:24,704 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 00:17:24,706 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 00:17:24,707 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 00:17:24,709 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 00:17:24,710 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 00:17:24,711 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 00:17:24,712 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 00:17:24,712 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 00:17:24,713 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 00:17:24,714 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 00:17:24,714 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 00:17:24,715 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 00:17:24,715 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 00:17:24,716 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 00:17:24,716 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 00:17:24,716 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 00:17:24,717 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 00:17:24,717 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 00:17:24,727 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 00:17:24,727 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 00:17:24,728 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 00:17:24,728 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 00:17:24,728 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 00:17:24,728 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 00:17:24,729 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 00:17:24,729 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 00:17:24,729 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 00:17:24,729 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 00:17:24,729 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 00:17:24,729 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 00:17:24,729 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 00:17:24,730 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-04 00:17:24,730 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 00:17:24,730 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 00:17:24,730 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 00:17:24,730 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 00:17:24,730 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 00:17:24,730 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 00:17:24,731 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 00:17:24,731 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 00:17:24,731 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 00:17:24,731 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 00:17:24,732 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 00:17:24,759 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 00:17:24,770 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 00:17:24,773 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 00:17:24,773 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 00:17:24,774 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 00:17:24,774 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memory-alloca/c.03-alloca_true-valid-memsafety.i [2018-02-04 00:17:24,911 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 00:17:24,912 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 00:17:24,912 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 00:17:24,912 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 00:17:24,918 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 00:17:24,919 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:17:24" (1/1) ... [2018-02-04 00:17:24,921 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@383c77a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:24, skipping insertion in model container [2018-02-04 00:17:24,921 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 12:17:24" (1/1) ... [2018-02-04 00:17:24,934 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:17:24,961 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 00:17:25,044 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:17:25,056 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 00:17:25,061 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:25 WrapperNode [2018-02-04 00:17:25,061 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 00:17:25,062 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 00:17:25,062 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 00:17:25,062 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 00:17:25,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:25" (1/1) ... [2018-02-04 00:17:25,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:25" (1/1) ... [2018-02-04 00:17:25,079 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:25" (1/1) ... [2018-02-04 00:17:25,079 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:25" (1/1) ... [2018-02-04 00:17:25,081 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:25" (1/1) ... [2018-02-04 00:17:25,083 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:25" (1/1) ... [2018-02-04 00:17:25,084 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:25" (1/1) ... [2018-02-04 00:17:25,085 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 00:17:25,085 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 00:17:25,085 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 00:17:25,085 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 00:17:25,086 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:25" (1/1) ... No working directory specified, using /home/ultimate/work/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-02-04 00:17:25,119 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 00:17:25,120 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 00:17:25,120 INFO L136 BoogieDeclarations]: Found implementation of procedure test_fun [2018-02-04 00:17:25,120 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 00:17:25,120 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 00:17:25,120 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 00:17:25,120 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 00:17:25,120 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 00:17:25,120 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 00:17:25,120 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 00:17:25,120 INFO L128 BoogieDeclarations]: Found specification of procedure test_fun [2018-02-04 00:17:25,121 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 00:17:25,121 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 00:17:25,121 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 00:17:25,318 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 00:17:25,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:17:25 BoogieIcfgContainer [2018-02-04 00:17:25,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 00:17:25,319 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 00:17:25,319 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 00:17:25,321 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 00:17:25,321 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 12:17:24" (1/3) ... [2018-02-04 00:17:25,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64297793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:17:25, skipping insertion in model container [2018-02-04 00:17:25,322 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 12:17:25" (2/3) ... [2018-02-04 00:17:25,322 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64297793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 12:17:25, skipping insertion in model container [2018-02-04 00:17:25,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 12:17:25" (3/3) ... [2018-02-04 00:17:25,324 INFO L107 eAbstractionObserver]: Analyzing ICFG c.03-alloca_true-valid-memsafety.i [2018-02-04 00:17:25,331 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 00:17:25,336 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 31 error locations. [2018-02-04 00:17:25,366 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 00:17:25,366 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 00:17:25,366 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 00:17:25,366 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 00:17:25,366 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 00:17:25,366 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 00:17:25,366 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 00:17:25,367 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 00:17:25,367 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 00:17:25,376 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states. [2018-02-04 00:17:25,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 00:17:25,382 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:25,383 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:25,383 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-02-04 00:17:25,388 INFO L82 PathProgramCache]: Analyzing trace with hash 2127926480, now seen corresponding path program 1 times [2018-02-04 00:17:25,390 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:25,390 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:25,426 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:25,426 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:25,426 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:25,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:25,483 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:25,653 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:17:25,655 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:17:25,655 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:17:25,657 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:17:25,669 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:17:25,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:17:25,672 INFO L87 Difference]: Start difference. First operand 84 states. Second operand 4 states. [2018-02-04 00:17:25,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:25,858 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-02-04 00:17:25,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:17:25,859 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 17 [2018-02-04 00:17:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:25,865 INFO L225 Difference]: With dead ends: 79 [2018-02-04 00:17:25,866 INFO L226 Difference]: Without dead ends: 76 [2018-02-04 00:17:25,867 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 4 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:17:25,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-02-04 00:17:25,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2018-02-04 00:17:25,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-04 00:17:25,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 77 transitions. [2018-02-04 00:17:25,893 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 77 transitions. Word has length 17 [2018-02-04 00:17:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:25,894 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 77 transitions. [2018-02-04 00:17:25,894 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:17:25,894 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 77 transitions. [2018-02-04 00:17:25,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 00:17:25,894 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:25,894 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:25,894 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-02-04 00:17:25,894 INFO L82 PathProgramCache]: Analyzing trace with hash 2127926481, now seen corresponding path program 1 times [2018-02-04 00:17:25,894 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:25,894 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:25,895 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:25,895 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:25,896 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:25,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:25,916 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:25,990 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:17:25,991 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:17:25,991 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:17:25,992 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:17:25,992 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:17:25,992 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:17:25,992 INFO L87 Difference]: Start difference. First operand 76 states and 77 transitions. Second operand 5 states. [2018-02-04 00:17:26,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:26,087 INFO L93 Difference]: Finished difference Result 71 states and 72 transitions. [2018-02-04 00:17:26,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:17:26,087 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-02-04 00:17:26,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:26,088 INFO L225 Difference]: With dead ends: 71 [2018-02-04 00:17:26,088 INFO L226 Difference]: Without dead ends: 71 [2018-02-04 00:17:26,089 INFO L554 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-02-04 00:17:26,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-02-04 00:17:26,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-02-04 00:17:26,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 00:17:26,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2018-02-04 00:17:26,094 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 17 [2018-02-04 00:17:26,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:26,095 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2018-02-04 00:17:26,095 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:17:26,095 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2018-02-04 00:17:26,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-02-04 00:17:26,095 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:26,096 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:26,096 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-02-04 00:17:26,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1541211425, now seen corresponding path program 1 times [2018-02-04 00:17:26,096 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:26,096 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:26,097 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:26,097 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:26,097 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:26,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:26,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:26,174 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:17:26,174 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:17:26,175 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 00:17:26,175 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 00:17:26,175 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 00:17:26,175 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:17:26,176 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand 5 states. [2018-02-04 00:17:26,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:26,259 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-02-04 00:17:26,260 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:17:26,260 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2018-02-04 00:17:26,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:26,261 INFO L225 Difference]: With dead ends: 67 [2018-02-04 00:17:26,261 INFO L226 Difference]: Without dead ends: 67 [2018-02-04 00:17:26,262 INFO L554 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-02-04 00:17:26,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-02-04 00:17:26,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-02-04 00:17:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-02-04 00:17:26,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2018-02-04 00:17:26,269 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 18 [2018-02-04 00:17:26,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:26,269 INFO L432 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2018-02-04 00:17:26,270 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 00:17:26,270 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2018-02-04 00:17:26,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:17:26,270 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:26,270 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:26,271 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-02-04 00:17:26,271 INFO L82 PathProgramCache]: Analyzing trace with hash 532913875, now seen corresponding path program 1 times [2018-02-04 00:17:26,271 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:26,271 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:26,272 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:26,272 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:26,273 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:26,284 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:26,315 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:17:26,315 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:17:26,315 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:17:26,316 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:17:26,316 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:17:26,316 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:17:26,316 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand 4 states. [2018-02-04 00:17:26,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:26,363 INFO L93 Difference]: Finished difference Result 63 states and 64 transitions. [2018-02-04 00:17:26,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:17:26,363 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2018-02-04 00:17:26,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:26,364 INFO L225 Difference]: With dead ends: 63 [2018-02-04 00:17:26,364 INFO L226 Difference]: Without dead ends: 63 [2018-02-04 00:17:26,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 00:17:26,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-04 00:17:26,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-02-04 00:17:26,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-02-04 00:17:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-02-04 00:17:26,369 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 19 [2018-02-04 00:17:26,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:26,369 INFO L432 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-02-04 00:17:26,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:17:26,370 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-02-04 00:17:26,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 00:17:26,370 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:26,370 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:26,371 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-02-04 00:17:26,371 INFO L82 PathProgramCache]: Analyzing trace with hash 532913876, now seen corresponding path program 1 times [2018-02-04 00:17:26,371 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:26,371 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:26,372 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:26,372 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:26,372 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:26,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:26,385 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:26,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:17:26,485 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:17:26,485 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-02-04 00:17:26,485 INFO L409 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-02-04 00:17:26,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-02-04 00:17:26,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-02-04 00:17:26,485 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 8 states. [2018-02-04 00:17:26,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:26,617 INFO L93 Difference]: Finished difference Result 59 states and 60 transitions. [2018-02-04 00:17:26,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-04 00:17:26,618 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2018-02-04 00:17:26,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:26,618 INFO L225 Difference]: With dead ends: 59 [2018-02-04 00:17:26,619 INFO L226 Difference]: Without dead ends: 59 [2018-02-04 00:17:26,619 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2018-02-04 00:17:26,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-02-04 00:17:26,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-02-04 00:17:26,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-02-04 00:17:26,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2018-02-04 00:17:26,622 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 19 [2018-02-04 00:17:26,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:26,622 INFO L432 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2018-02-04 00:17:26,622 INFO L433 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-02-04 00:17:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2018-02-04 00:17:26,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 00:17:26,623 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:26,623 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:26,623 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-02-04 00:17:26,623 INFO L82 PathProgramCache]: Analyzing trace with hash -659539069, now seen corresponding path program 1 times [2018-02-04 00:17:26,624 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:26,624 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:26,624 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:26,624 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:26,624 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:26,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:26,632 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:26,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:17:26,651 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:17:26,652 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:17:26,652 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:17:26,652 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:17:26,652 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:17:26,652 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand 4 states. [2018-02-04 00:17:26,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:26,709 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-02-04 00:17:26,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 00:17:26,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-04 00:17:26,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:26,710 INFO L225 Difference]: With dead ends: 55 [2018-02-04 00:17:26,710 INFO L226 Difference]: Without dead ends: 55 [2018-02-04 00:17:26,710 INFO L554 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-02-04 00:17:26,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-02-04 00:17:26,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-02-04 00:17:26,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-02-04 00:17:26,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-02-04 00:17:26,713 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 20 [2018-02-04 00:17:26,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:26,713 INFO L432 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-02-04 00:17:26,713 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:17:26,713 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-02-04 00:17:26,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 00:17:26,714 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:26,714 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:26,714 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-02-04 00:17:26,714 INFO L82 PathProgramCache]: Analyzing trace with hash -659539068, now seen corresponding path program 1 times [2018-02-04 00:17:26,714 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:26,714 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:26,715 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:26,715 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:26,715 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:26,723 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:17:26,754 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:17:26,754 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 00:17:26,754 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 00:17:26,754 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 00:17:26,754 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 00:17:26,755 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 4 states. [2018-02-04 00:17:26,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:26,788 INFO L93 Difference]: Finished difference Result 51 states and 52 transitions. [2018-02-04 00:17:26,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 00:17:26,788 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 20 [2018-02-04 00:17:26,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:26,789 INFO L225 Difference]: With dead ends: 51 [2018-02-04 00:17:26,789 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 00:17:26,789 INFO L554 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-02-04 00:17:26,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 00:17:26,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 00:17:26,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 00:17:26,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-02-04 00:17:26,792 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 20 [2018-02-04 00:17:26,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:26,792 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-02-04 00:17:26,792 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 00:17:26,793 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-02-04 00:17:26,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-02-04 00:17:26,793 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 00:17:26,793 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 00:17:26,793 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-02-04 00:17:26,794 INFO L82 PathProgramCache]: Analyzing trace with hash -1501734176, now seen corresponding path program 1 times [2018-02-04 00:17:26,794 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 00:17:26,794 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 00:17:26,795 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:26,795 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 00:17:26,795 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 00:17:26,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 00:17:26,812 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 00:17:27,288 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 00:17:27,288 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 00:17:27,288 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-02-04 00:17:27,289 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 00:17:27,289 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 00:17:27,289 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-02-04 00:17:27,289 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 10 states. [2018-02-04 00:17:27,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 00:17:27,580 INFO L93 Difference]: Finished difference Result 50 states and 51 transitions. [2018-02-04 00:17:27,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-02-04 00:17:27,580 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-02-04 00:17:27,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 00:17:27,581 INFO L225 Difference]: With dead ends: 50 [2018-02-04 00:17:27,581 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 00:17:27,581 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-02-04 00:17:27,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 00:17:27,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 00:17:27,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 00:17:27,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 00:17:27,582 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 38 [2018-02-04 00:17:27,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 00:17:27,582 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 00:17:27,582 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 00:17:27,582 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 00:17:27,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 00:17:27,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 12:17:27 BoogieIcfgContainer [2018-02-04 00:17:27,586 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 00:17:27,586 INFO L168 Benchmark]: Toolchain (without parser) took 2675.06 ms. Allocated memory was 405.3 MB in the beginning and 663.2 MB in the end (delta: 257.9 MB). Free memory was 362.0 MB in the beginning and 569.6 MB in the end (delta: -207.6 MB). Peak memory consumption was 50.3 MB. Max. memory is 5.3 GB. [2018-02-04 00:17:27,587 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 405.3 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 00:17:27,587 INFO L168 Benchmark]: CACSL2BoogieTranslator took 149.48 ms. Allocated memory is still 405.3 MB. Free memory was 362.0 MB in the beginning and 351.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 00:17:27,587 INFO L168 Benchmark]: Boogie Preprocessor took 23.00 ms. Allocated memory is still 405.3 MB. Free memory was 351.4 MB in the beginning and 348.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 00:17:27,587 INFO L168 Benchmark]: RCFGBuilder took 233.53 ms. Allocated memory is still 405.3 MB. Free memory was 348.7 MB in the beginning and 326.3 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. [2018-02-04 00:17:27,588 INFO L168 Benchmark]: TraceAbstraction took 2266.66 ms. Allocated memory was 405.3 MB in the beginning and 663.2 MB in the end (delta: 257.9 MB). Free memory was 323.6 MB in the beginning and 569.6 MB in the end (delta: -246.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. [2018-02-04 00:17:27,589 INFO L344 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11 ms. Allocated memory is still 405.3 MB. Free memory is still 367.2 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 149.48 ms. Allocated memory is still 405.3 MB. Free memory was 362.0 MB in the beginning and 351.4 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.00 ms. Allocated memory is still 405.3 MB. Free memory was 351.4 MB in the beginning and 348.7 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 233.53 ms. Allocated memory is still 405.3 MB. Free memory was 348.7 MB in the beginning and 326.3 MB in the end (delta: 22.5 MB). Peak memory consumption was 22.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2266.66 ms. Allocated memory was 405.3 MB in the beginning and 663.2 MB in the end (delta: 257.9 MB). Free memory was 323.6 MB in the beginning and 569.6 MB in the end (delta: -246.0 MB). Peak memory consumption was 12.0 MB. Max. memory is 5.3 GB. * 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 84 locations, 31 error locations. SAFE Result, 2.2s OverallTime, 8 OverallIterations, 1 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 271 SDtfs, 648 SDslu, 388 SDs, 0 SdLazy, 610 SolverSat, 56 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 63 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=84occurred 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: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 168 NumberOfCodeBlocks, 168 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 160 ConstructedInterpolants, 0 QuantifiedInterpolants, 67094 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 /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/c.03-alloca_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_00-17-27-596.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/c.03-alloca_true-valid-memsafety.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_00-17-27-596.csv Received shutdown request...