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_SmtInterpol_Array.epf -i ../../../trunk/examples/svcomp/array-memsafety/stroeder1-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 15:07:17,514 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 15:07:17,515 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 15:07:17,525 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 15:07:17,525 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 15:07:17,525 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 15:07:17,526 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 15:07:17,527 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 15:07:17,529 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 15:07:17,530 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 15:07:17,530 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 15:07:17,531 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 15:07:17,531 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 15:07:17,532 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 15:07:17,533 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 15:07:17,535 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 15:07:17,536 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 15:07:17,538 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 15:07:17,539 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 15:07:17,539 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 15:07:17,541 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 15:07:17,541 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 15:07:17,542 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 15:07:17,542 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 15:07:17,543 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 15:07:17,544 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 15:07:17,544 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 15:07:17,545 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 15:07:17,545 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 15:07:17,545 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 15:07:17,545 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 15:07:17,546 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf [2018-02-04 15:07:17,555 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 15:07:17,555 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 15:07:17,556 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 15:07:17,556 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 15:07:17,556 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 15:07:17,556 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 15:07:17,557 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 15:07:17,557 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 15:07:17,557 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 15:07:17,557 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 15:07:17,557 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 15:07:17,557 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 15:07:17,557 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 15:07:17,558 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 15:07:17,558 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 15:07:17,558 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 15:07:17,558 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 15:07:17,558 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 15:07:17,559 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 15:07:17,559 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 15:07:17,559 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 15:07:17,559 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-04 15:07:17,590 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 15:07:17,599 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 15:07:17,603 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 15:07:17,604 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 15:07:17,604 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 15:07:17,605 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/stroeder1-alloca_true-valid-memsafety_true-termination.i [2018-02-04 15:07:17,744 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 15:07:17,745 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 15:07:17,749 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 15:07:17,749 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 15:07:17,755 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 15:07:17,756 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:07:17" (1/1) ... [2018-02-04 15:07:17,759 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5208d2f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:17, skipping insertion in model container [2018-02-04 15:07:17,759 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 03:07:17" (1/1) ... [2018-02-04 15:07:17,772 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:07:17,798 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 15:07:17,879 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:07:17,890 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 15:07:17,894 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:17 WrapperNode [2018-02-04 15:07:17,895 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 15:07:17,895 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 15:07:17,895 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 15:07:17,895 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 15:07:17,904 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:17" (1/1) ... [2018-02-04 15:07:17,904 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:17" (1/1) ... [2018-02-04 15:07:17,911 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:17" (1/1) ... [2018-02-04 15:07:17,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:17" (1/1) ... [2018-02-04 15:07:17,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:17" (1/1) ... [2018-02-04 15:07:17,917 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:17" (1/1) ... [2018-02-04 15:07:17,917 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:17" (1/1) ... [2018-02-04 15:07:17,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 15:07:17,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 15:07:17,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 15:07:17,919 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 15:07:17,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:17" (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 15:07:17,952 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 15:07:17,952 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 15:07:17,952 INFO L136 BoogieDeclarations]: Found implementation of procedure sumOfThirdBytes [2018-02-04 15:07:17,952 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 15:07:17,952 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 15:07:17,952 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 15:07:17,952 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 15:07:17,952 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 15:07:17,953 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 15:07:17,953 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 15:07:17,953 INFO L128 BoogieDeclarations]: Found specification of procedure sumOfThirdBytes [2018-02-04 15:07:17,953 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 15:07:17,953 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 15:07:17,953 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 15:07:18,045 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 15:07:18,046 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:07:18 BoogieIcfgContainer [2018-02-04 15:07:18,046 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 15:07:18,046 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 15:07:18,046 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 15:07:18,048 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 15:07:18,048 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 03:07:17" (1/3) ... [2018-02-04 15:07:18,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af0d4fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:07:18, skipping insertion in model container [2018-02-04 15:07:18,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 03:07:17" (2/3) ... [2018-02-04 15:07:18,049 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6af0d4fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 03:07:18, skipping insertion in model container [2018-02-04 15:07:18,049 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 03:07:18" (3/3) ... [2018-02-04 15:07:18,050 INFO L107 eAbstractionObserver]: Analyzing ICFG stroeder1-alloca_true-valid-memsafety_true-termination.i [2018-02-04 15:07:18,056 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-04 15:07:18,060 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-04 15:07:18,089 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 15:07:18,089 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 15:07:18,089 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-04 15:07:18,089 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-04 15:07:18,089 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 15:07:18,089 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 15:07:18,089 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 15:07:18,090 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 15:07:18,090 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 15:07:18,098 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-02-04 15:07:18,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 15:07:18,107 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:18,108 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:18,108 INFO L371 AbstractCegarLoop]: === Iteration 1 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:18,111 INFO L82 PathProgramCache]: Analyzing trace with hash -443509723, now seen corresponding path program 1 times [2018-02-04 15:07:18,146 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:18,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:18,184 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:18,276 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 15:07:18,279 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:18,279 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 15:07:18,280 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:18,281 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 15:07:18,281 INFO L182 omatonBuilderFactory]: Interpolants [32#true, 33#false, 34#(= 1 (select |#valid| |main_#t~malloc3.base|)), 35#(= 1 (select |#valid| main_~numbers~0.base)), 36#(= 1 (select |#valid| |sumOfThirdBytes_#in~numbers.base|)), 37#(= 1 (select |#valid| |sumOfThirdBytes_~#numbers.base|)), 38#(= 1 (select |#valid| sumOfThirdBytes_~p~0.base))] [2018-02-04 15:07:18,281 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 15:07:18,282 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 15:07:18,295 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 15:07:18,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:07:18,297 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 7 states. [2018-02-04 15:07:18,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:18,463 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-02-04 15:07:18,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 15:07:18,465 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-04 15:07:18,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:18,544 INFO L225 Difference]: With dead ends: 33 [2018-02-04 15:07:18,545 INFO L226 Difference]: Without dead ends: 30 [2018-02-04 15:07:18,548 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-04 15:07:18,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-04 15:07:18,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2018-02-04 15:07:18,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-04 15:07:18,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-02-04 15:07:18,570 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 14 [2018-02-04 15:07:18,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:18,570 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-02-04 15:07:18,570 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 15:07:18,570 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-02-04 15:07:18,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 15:07:18,571 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:18,571 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:18,571 INFO L371 AbstractCegarLoop]: === Iteration 2 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:18,571 INFO L82 PathProgramCache]: Analyzing trace with hash -443509722, now seen corresponding path program 1 times [2018-02-04 15:07:18,572 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:18,586 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:18,676 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 15:07:18,676 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:18,677 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 15:07:18,677 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:18,677 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 15:07:18,677 INFO L182 omatonBuilderFactory]: Interpolants [103#true, 104#false, 105#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 106#(and (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base))), 107#(and (= 0 |sumOfThirdBytes_#in~numbers.offset|) (<= (* 4 |sumOfThirdBytes_#in~array_size|) (select |#length| |sumOfThirdBytes_#in~numbers.base|))), 108#(and (= sumOfThirdBytes_~i~0 0) (<= (* 4 sumOfThirdBytes_~array_size) (select |#length| |sumOfThirdBytes_~#numbers.base|)) (= |sumOfThirdBytes_~#numbers.offset| 0)), 109#(and (<= 2 sumOfThirdBytes_~p~0.offset) (<= (+ sumOfThirdBytes_~p~0.offset 2) (select |#length| sumOfThirdBytes_~p~0.base)))] [2018-02-04 15:07:18,677 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 15:07:18,678 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 15:07:18,679 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 15:07:18,679 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-04 15:07:18,679 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2018-02-04 15:07:18,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:18,803 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-02-04 15:07:18,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-04 15:07:18,803 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-04 15:07:18,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:18,804 INFO L225 Difference]: With dead ends: 38 [2018-02-04 15:07:18,804 INFO L226 Difference]: Without dead ends: 38 [2018-02-04 15:07:18,805 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-02-04 15:07:18,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-04 15:07:18,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-02-04 15:07:18,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-04 15:07:18,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-02-04 15:07:18,807 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 14 [2018-02-04 15:07:18,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:18,807 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-02-04 15:07:18,807 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 15:07:18,808 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-02-04 15:07:18,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 15:07:18,808 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:18,809 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:18,809 INFO L371 AbstractCegarLoop]: === Iteration 3 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:18,809 INFO L82 PathProgramCache]: Analyzing trace with hash -537553629, now seen corresponding path program 1 times [2018-02-04 15:07:18,809 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:18,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:18,818 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:18,897 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:18,897 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-04 15:07:18,897 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:18,897 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 15:07:18,897 INFO L182 omatonBuilderFactory]: Interpolants [192#(and (<= (* 4 sumOfThirdBytes_~array_size) (+ (* 4 sumOfThirdBytes_~i~0) |sumOfThirdBytes_~#numbers.offset| 6)) (= |sumOfThirdBytes_~#numbers.offset| 0)), 193#(and (<= (* 4 sumOfThirdBytes_~array_size) (+ (* 4 sumOfThirdBytes_~i~0) |sumOfThirdBytes_~#numbers.offset| 2)) (= |sumOfThirdBytes_~#numbers.offset| 0)), 184#true, 185#false, 186#(<= main_~array_size~0 1), 187#(and (<= main_~array_size~0 1) (= 0 |main_#t~malloc3.offset|)), 188#(and (<= main_~array_size~0 1) (= 0 main_~numbers~0.offset)), 189#(and (= 0 |sumOfThirdBytes_#in~numbers.offset|) (<= |sumOfThirdBytes_#in~array_size| 1)), 190#(and (<= sumOfThirdBytes_~array_size 1) (= |sumOfThirdBytes_~#numbers.offset| 0)), 191#(and (<= (+ sumOfThirdBytes_~p~0.offset (* 4 sumOfThirdBytes_~array_size)) (+ (* 4 sumOfThirdBytes_~i~0) |sumOfThirdBytes_~#numbers.offset| 6)) (= |sumOfThirdBytes_~#numbers.offset| 0))] [2018-02-04 15:07:18,898 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:18,898 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 15:07:18,898 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 15:07:18,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-04 15:07:18,898 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 10 states. [2018-02-04 15:07:18,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:18,987 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-02-04 15:07:18,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-04 15:07:18,988 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-02-04 15:07:18,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:18,988 INFO L225 Difference]: With dead ends: 50 [2018-02-04 15:07:18,989 INFO L226 Difference]: Without dead ends: 50 [2018-02-04 15:07:18,989 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2018-02-04 15:07:18,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-04 15:07:18,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-02-04 15:07:18,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 15:07:18,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-02-04 15:07:18,992 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 19 [2018-02-04 15:07:18,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:18,992 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-02-04 15:07:18,992 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 15:07:18,992 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-02-04 15:07:18,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-04 15:07:18,993 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:18,993 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:18,993 INFO L371 AbstractCegarLoop]: === Iteration 4 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:18,993 INFO L82 PathProgramCache]: Analyzing trace with hash -1124359643, now seen corresponding path program 1 times [2018-02-04 15:07:18,993 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:19,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:19,002 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:19,135 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:19,136 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-04 15:07:19,136 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-04 15:07:19,136 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:19,136 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 15:07:19,136 INFO L182 omatonBuilderFactory]: Interpolants [304#(and (<= 2 (+ (* 4 sumOfThirdBytes_~i~0) |sumOfThirdBytes_~#numbers.offset|)) (<= (* 4 sumOfThirdBytes_~array_size) (select |#length| |sumOfThirdBytes_~#numbers.base|)) (= |sumOfThirdBytes_~#numbers.offset| 0)), 305#(and (<= 4 sumOfThirdBytes_~p~0.offset) (<= (+ sumOfThirdBytes_~p~0.offset 2) (select |#length| sumOfThirdBytes_~p~0.base))), 296#true, 297#false, 298#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 299#(and (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base))), 300#(and (= 0 |sumOfThirdBytes_#in~numbers.offset|) (<= (* 4 |sumOfThirdBytes_#in~array_size|) (select |#length| |sumOfThirdBytes_#in~numbers.base|))), 301#(and (<= (* 4 sumOfThirdBytes_~array_size) (select |#length| |sumOfThirdBytes_~#numbers.base|)) (= |sumOfThirdBytes_~#numbers.offset| 0)), 302#(and (<= (* 4 sumOfThirdBytes_~array_size) (select |#length| |sumOfThirdBytes_~#numbers.base|)) (<= sumOfThirdBytes_~p~0.offset (+ (* 4 sumOfThirdBytes_~i~0) |sumOfThirdBytes_~#numbers.offset| 2)) (= |sumOfThirdBytes_~#numbers.offset| 0)), 303#(and (<= 0 (+ (* 4 sumOfThirdBytes_~i~0) |sumOfThirdBytes_~#numbers.offset| 2)) (<= (* 4 sumOfThirdBytes_~array_size) (select |#length| |sumOfThirdBytes_~#numbers.base|)) (= |sumOfThirdBytes_~#numbers.offset| 0))] [2018-02-04 15:07:19,137 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 15:07:19,137 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-04 15:07:19,137 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-04 15:07:19,137 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-04 15:07:19,138 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 10 states. [2018-02-04 15:07:19,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:19,322 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-04 15:07:19,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 15:07:19,323 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-02-04 15:07:19,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:19,324 INFO L225 Difference]: With dead ends: 54 [2018-02-04 15:07:19,324 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 15:07:19,325 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-02-04 15:07:19,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 15:07:19,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2018-02-04 15:07:19,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-04 15:07:19,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-02-04 15:07:19,331 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 19 [2018-02-04 15:07:19,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:19,333 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-02-04 15:07:19,333 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-04 15:07:19,333 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-02-04 15:07:19,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 15:07:19,333 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:19,334 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 15:07:19,334 INFO L371 AbstractCegarLoop]: === Iteration 5 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:19,334 INFO L82 PathProgramCache]: Analyzing trace with hash 950757514, now seen corresponding path program 1 times [2018-02-04 15:07:19,335 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:19,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:19,345 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:19,384 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 15:07:19,384 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:19,384 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 15:07:19,385 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:19,385 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 15:07:19,385 INFO L182 omatonBuilderFactory]: Interpolants [408#true, 409#false, 410#(<= 1 main_~array_size~0), 411#(and (= sumOfThirdBytes_~i~0 0) (<= |sumOfThirdBytes_#in~array_size| sumOfThirdBytes_~array_size)), 412#(<= |sumOfThirdBytes_#in~array_size| 0)] [2018-02-04 15:07:19,385 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 15:07:19,385 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 15:07:19,385 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 15:07:19,386 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 15:07:19,386 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 5 states. [2018-02-04 15:07:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:19,401 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-02-04 15:07:19,401 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:07:19,402 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-04 15:07:19,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:19,402 INFO L225 Difference]: With dead ends: 49 [2018-02-04 15:07:19,402 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 15:07:19,402 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 15:07:19,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 15:07:19,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-02-04 15:07:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 15:07:19,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-02-04 15:07:19,406 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 20 [2018-02-04 15:07:19,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:19,407 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-02-04 15:07:19,407 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 15:07:19,407 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-02-04 15:07:19,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 15:07:19,407 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 15:07:19,408 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 15:07:19,408 INFO L371 AbstractCegarLoop]: === Iteration 6 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-04 15:07:19,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1524168647, now seen corresponding path program 1 times [2018-02-04 15:07:19,409 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-04 15:07:19,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 15:07:19,421 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 15:07:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 15:07:19,452 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 15:07:19,452 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 15:07:19,452 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-04 15:07:19,452 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 15:07:19,452 INFO L182 omatonBuilderFactory]: Interpolants [504#true, 505#false, 506#(= |#valid| |old(#valid)|), 507#(= |old(#valid)| (store |#valid| |main_#t~malloc3.base| 0))] [2018-02-04 15:07:19,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 15:07:19,452 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 15:07:19,453 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 15:07:19,453 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 15:07:19,453 INFO L87 Difference]: Start difference. First operand 40 states and 41 transitions. Second operand 4 states. [2018-02-04 15:07:19,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 15:07:19,480 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2018-02-04 15:07:19,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 15:07:19,481 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-02-04 15:07:19,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 15:07:19,481 INFO L225 Difference]: With dead ends: 39 [2018-02-04 15:07:19,481 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 15:07:19,481 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 15:07:19,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 15:07:19,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 15:07:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 15:07:19,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 15:07:19,482 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 25 [2018-02-04 15:07:19,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 15:07:19,482 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 15:07:19,482 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 15:07:19,482 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 15:07:19,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 15:07:19,488 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 03:07:19 BoogieIcfgContainer [2018-02-04 15:07:19,488 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 15:07:19,488 INFO L168 Benchmark]: Toolchain (without parser) took 1744.09 ms. Allocated memory was 407.9 MB in the beginning and 610.3 MB in the end (delta: 202.4 MB). Free memory was 365.7 MB in the beginning and 429.3 MB in the end (delta: -63.6 MB). Peak memory consumption was 138.7 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:19,489 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 407.9 MB. Free memory is still 371.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 15:07:19,489 INFO L168 Benchmark]: CACSL2BoogieTranslator took 145.88 ms. Allocated memory is still 407.9 MB. Free memory was 364.4 MB in the beginning and 355.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:19,490 INFO L168 Benchmark]: Boogie Preprocessor took 23.16 ms. Allocated memory is still 407.9 MB. Free memory was 355.1 MB in the beginning and 352.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:19,490 INFO L168 Benchmark]: RCFGBuilder took 127.35 ms. Allocated memory is still 407.9 MB. Free memory was 352.5 MB in the beginning and 337.9 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:19,490 INFO L168 Benchmark]: TraceAbstraction took 1441.78 ms. Allocated memory was 407.9 MB in the beginning and 610.3 MB in the end (delta: 202.4 MB). Free memory was 336.6 MB in the beginning and 429.3 MB in the end (delta: -92.8 MB). Peak memory consumption was 109.6 MB. Max. memory is 5.3 GB. [2018-02-04 15:07:19,491 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.15 ms. Allocated memory is still 407.9 MB. Free memory is still 371.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 145.88 ms. Allocated memory is still 407.9 MB. Free memory was 364.4 MB in the beginning and 355.1 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 23.16 ms. Allocated memory is still 407.9 MB. Free memory was 355.1 MB in the beginning and 352.5 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 127.35 ms. Allocated memory is still 407.9 MB. Free memory was 352.5 MB in the beginning and 337.9 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1441.78 ms. Allocated memory was 407.9 MB in the beginning and 610.3 MB in the end (delta: 202.4 MB). Free memory was 336.6 MB in the beginning and 429.3 MB in the end (delta: -92.8 MB). Peak memory consumption was 109.6 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: 552]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 29 locations, 3 error locations. SAFE Result, 1.4s OverallTime, 6 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 133 SDtfs, 173 SDslu, 401 SDs, 0 SdLazy, 303 SolverSat, 32 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 59 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 5/8 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, 6 MinimizatonAttempts, 42 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 111 NumberOfCodeBlocks, 111 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 8715 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 4 PerfectInterpolantSequences, 5/8 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/stroeder1-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_15-07-19-499.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/stroeder1-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_Array.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_15-07-19-499.csv Received shutdown request...