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/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf -i ../../../trunk/examples/svcomp/array-memsafety/stroeder1-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:37:04,801 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:37:04,803 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:37:04,815 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:37:04,815 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:37:04,816 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:37:04,817 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:37:04,818 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:37:04,820 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:37:04,820 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:37:04,821 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:37:04,821 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:37:04,822 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:37:04,823 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:37:04,824 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:37:04,825 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:37:04,827 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:37:04,829 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:37:04,830 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:37:04,831 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:37:04,832 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:37:04,833 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:37:04,833 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:37:04,834 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:37:04,834 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:37:04,835 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:37:04,835 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:37:04,836 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:37:04,836 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:37:04,836 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:37:04,836 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:37:04,837 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cav18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf [2018-02-02 10:37:04,846 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:37:04,847 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:37:04,848 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:37:04,848 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:37:04,848 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:37:04,848 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:37:04,848 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:37:04,849 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:37:04,849 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:37:04,849 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:37:04,849 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:37:04,849 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:37:04,849 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:37:04,849 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:37:04,849 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:37:04,849 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:37:04,849 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:37:04,850 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:37:04,850 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:37:04,850 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:37:04,850 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:37:04,850 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:37:04,850 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:37:04,850 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:37:04,877 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:37:04,886 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:37:04,888 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:37:04,889 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:37:04,889 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:37:04,890 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-02 10:37:05,020 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:37:05,021 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:37:05,022 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:37:05,022 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:37:05,028 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:37:05,029 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:37:05" (1/1) ... [2018-02-02 10:37:05,031 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@421f655e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:05, skipping insertion in model container [2018-02-02 10:37:05,032 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:37:05" (1/1) ... [2018-02-02 10:37:05,044 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:37:05,070 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:37:05,157 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:37:05,171 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:37:05,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:05 WrapperNode [2018-02-02 10:37:05,177 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:37:05,177 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:37:05,177 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:37:05,177 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:37:05,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:05" (1/1) ... [2018-02-02 10:37:05,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:05" (1/1) ... [2018-02-02 10:37:05,193 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:05" (1/1) ... [2018-02-02 10:37:05,193 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:05" (1/1) ... [2018-02-02 10:37:05,196 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:05" (1/1) ... [2018-02-02 10:37:05,198 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:05" (1/1) ... [2018-02-02 10:37:05,199 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:05" (1/1) ... [2018-02-02 10:37:05,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:37:05,200 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:37:05,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:37:05,201 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:37:05,201 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:05" (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-02 10:37:05,236 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:37:05,236 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:37:05,237 INFO L136 BoogieDeclarations]: Found implementation of procedure sumOfThirdBytes [2018-02-02 10:37:05,237 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:37:05,237 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:37:05,237 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:37:05,237 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:37:05,237 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:37:05,237 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:37:05,238 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:37:05,238 INFO L128 BoogieDeclarations]: Found specification of procedure sumOfThirdBytes [2018-02-02 10:37:05,238 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:37:05,238 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:37:05,238 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:37:05,340 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:37:05,340 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:37:05 BoogieIcfgContainer [2018-02-02 10:37:05,340 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:37:05,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:37:05,341 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:37:05,342 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:37:05,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:37:05" (1/3) ... [2018-02-02 10:37:05,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c602ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:37:05, skipping insertion in model container [2018-02-02 10:37:05,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:37:05" (2/3) ... [2018-02-02 10:37:05,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c602ea2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:37:05, skipping insertion in model container [2018-02-02 10:37:05,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:37:05" (3/3) ... [2018-02-02 10:37:05,344 INFO L107 eAbstractionObserver]: Analyzing ICFG stroeder1-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:37:05,350 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:37:05,354 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-02-02 10:37:05,380 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:37:05,380 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:37:05,381 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:37:05,381 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:37:05,381 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:37:05,381 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:37:05,381 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:37:05,381 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:37:05,382 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:37:05,392 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2018-02-02 10:37:05,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:37:05,399 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:05,400 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:05,400 INFO L371 AbstractCegarLoop]: === Iteration 1 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:37:05,404 INFO L82 PathProgramCache]: Analyzing trace with hash -443509723, now seen corresponding path program 1 times [2018-02-02 10:37:05,453 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:05,497 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:05,599 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-02 10:37:05,601 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:37:05,601 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:37:05,602 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:05,602 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-02 10:37:05,602 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-02 10:37:05,602 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-02 10:37:05,603 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:37:05,611 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:37:05,612 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:37:05,613 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 7 states. [2018-02-02 10:37:05,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:05,736 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2018-02-02 10:37:05,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:37:05,738 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-02 10:37:05,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:05,745 INFO L225 Difference]: With dead ends: 33 [2018-02-02 10:37:05,745 INFO L226 Difference]: Without dead ends: 30 [2018-02-02 10:37:05,746 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:37:05,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-02-02 10:37:05,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2018-02-02 10:37:05,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-02-02 10:37:05,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2018-02-02 10:37:05,818 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 14 [2018-02-02 10:37:05,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:05,819 INFO L432 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2018-02-02 10:37:05,819 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:37:05,819 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2018-02-02 10:37:05,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-02 10:37:05,819 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:05,819 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:05,819 INFO L371 AbstractCegarLoop]: === Iteration 2 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:37:05,820 INFO L82 PathProgramCache]: Analyzing trace with hash -443509722, now seen corresponding path program 1 times [2018-02-02 10:37:05,820 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:05,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:05,835 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:05,925 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-02 10:37:05,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:37:05,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:37:05,925 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:05,926 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-02 10:37:05,926 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-02 10:37:05,926 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-02 10:37:05,928 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:37:05,928 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:37:05,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:37:05,929 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 7 states. [2018-02-02 10:37:06,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:06,086 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-02-02 10:37:06,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:37:06,087 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2018-02-02 10:37:06,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:06,087 INFO L225 Difference]: With dead ends: 38 [2018-02-02 10:37:06,088 INFO L226 Difference]: Without dead ends: 38 [2018-02-02 10:37:06,088 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2018-02-02 10:37:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-02-02 10:37:06,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2018-02-02 10:37:06,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-02-02 10:37:06,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2018-02-02 10:37:06,093 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 14 [2018-02-02 10:37:06,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:06,094 INFO L432 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2018-02-02 10:37:06,094 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:37:06,094 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2018-02-02 10:37:06,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:37:06,094 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:06,095 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:06,095 INFO L371 AbstractCegarLoop]: === Iteration 3 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:37:06,095 INFO L82 PathProgramCache]: Analyzing trace with hash -537553629, now seen corresponding path program 1 times [2018-02-02 10:37:06,096 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:06,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:06,114 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:06,212 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-02 10:37:06,212 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:06,212 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:37:06,213 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:06,213 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-02 10:37:06,213 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-02 10:37:06,214 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-02 10:37:06,214 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:37:06,214 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:37:06,214 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:37:06,215 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand 10 states. [2018-02-02 10:37:06,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:06,336 INFO L93 Difference]: Finished difference Result 50 states and 52 transitions. [2018-02-02 10:37:06,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-02-02 10:37:06,337 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-02-02 10:37:06,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:06,338 INFO L225 Difference]: With dead ends: 50 [2018-02-02 10:37:06,338 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 10:37:06,339 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-02 10:37:06,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 10:37:06,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 42. [2018-02-02 10:37:06,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-02 10:37:06,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 45 transitions. [2018-02-02 10:37:06,343 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 45 transitions. Word has length 19 [2018-02-02 10:37:06,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:06,343 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 45 transitions. [2018-02-02 10:37:06,344 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:37:06,344 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 45 transitions. [2018-02-02 10:37:06,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-02-02 10:37:06,344 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:06,345 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:06,345 INFO L371 AbstractCegarLoop]: === Iteration 4 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:37:06,345 INFO L82 PathProgramCache]: Analyzing trace with hash -1124359643, now seen corresponding path program 1 times [2018-02-02 10:37:06,346 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:06,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:06,357 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:06,458 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-02 10:37:06,458 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:06,458 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:37:06,459 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:06,459 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-02 10:37:06,459 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-02 10:37:06,459 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-02 10:37:06,460 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:37:06,460 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:37:06,460 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:37:06,460 INFO L87 Difference]: Start difference. First operand 42 states and 45 transitions. Second operand 10 states. [2018-02-02 10:37:06,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:06,598 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-02-02 10:37:06,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:37:06,599 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 19 [2018-02-02 10:37:06,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:06,599 INFO L225 Difference]: With dead ends: 54 [2018-02-02 10:37:06,599 INFO L226 Difference]: Without dead ends: 54 [2018-02-02 10:37:06,599 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-02 10:37:06,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-02 10:37:06,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 38. [2018-02-02 10:37:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-02-02 10:37:06,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2018-02-02 10:37:06,603 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 19 [2018-02-02 10:37:06,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:06,603 INFO L432 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2018-02-02 10:37:06,603 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:37:06,603 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2018-02-02 10:37:06,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:37:06,603 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:06,603 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-02 10:37:06,604 INFO L371 AbstractCegarLoop]: === Iteration 5 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:37:06,604 INFO L82 PathProgramCache]: Analyzing trace with hash 950757514, now seen corresponding path program 1 times [2018-02-02 10:37:06,604 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:06,612 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:06,636 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-02 10:37:06,636 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:37:06,636 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:37:06,636 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:06,637 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-02 10:37:06,637 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-02 10:37:06,637 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-02 10:37:06,637 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:37:06,637 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:37:06,637 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:37:06,637 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand 5 states. [2018-02-02 10:37:06,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:06,653 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-02-02 10:37:06,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:37:06,653 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 10:37:06,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:06,654 INFO L225 Difference]: With dead ends: 49 [2018-02-02 10:37:06,654 INFO L226 Difference]: Without dead ends: 43 [2018-02-02 10:37:06,655 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-02 10:37:06,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-02 10:37:06,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2018-02-02 10:37:06,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-02 10:37:06,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 41 transitions. [2018-02-02 10:37:06,659 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 41 transitions. Word has length 20 [2018-02-02 10:37:06,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:06,659 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 41 transitions. [2018-02-02 10:37:06,660 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:37:06,660 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 41 transitions. [2018-02-02 10:37:06,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-02 10:37:06,660 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:06,660 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-02 10:37:06,660 INFO L371 AbstractCegarLoop]: === Iteration 6 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr0RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:37:06,660 INFO L82 PathProgramCache]: Analyzing trace with hash 1524168647, now seen corresponding path program 1 times [2018-02-02 10:37:06,661 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:06,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:06,676 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:37:06,680 FATAL L292 ToolchainWalker]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.UnsupportedOperationException: Unknown lemma type! at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.access$1(Interpolator.java:263) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:132) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:122) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:113) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:220) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:201) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:915) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:281) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:164) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsTree(InterpolatingTraceCheckCraig.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:199) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:106) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructCraig(TraceCheckConstructor.java:222) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:179) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.FixedTraceAbstractionRefinementStrategy.getTraceCheck(FixedTraceAbstractionRefinementStrategy.java:131) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:231) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:205) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:397) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterateInternal(AbstractCegarLoop.java:381) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:316) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.iterate(TraceAbstractionStarter.java:292) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:147) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:115) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:119) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:324) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.runToolchainDefault(DefaultToolchainJob.java:221) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.BasicToolchainJob.run(BasicToolchainJob.java:134) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2018-02-02 10:37:06,684 INFO L168 Benchmark]: Toolchain (without parser) took 1662.71 ms. Allocated memory was 398.5 MB in the beginning and 599.3 MB in the end (delta: 200.8 MB). Free memory was 356.5 MB in the beginning and 431.4 MB in the end (delta: -75.0 MB). Peak memory consumption was 125.8 MB. Max. memory is 5.3 GB. [2018-02-02 10:37:06,685 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 398.5 MB. Free memory is still 361.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:37:06,685 INFO L168 Benchmark]: CACSL2BoogieTranslator took 154.59 ms. Allocated memory is still 398.5 MB. Free memory was 355.1 MB in the beginning and 345.9 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:37:06,685 INFO L168 Benchmark]: Boogie Preprocessor took 23.11 ms. Allocated memory is still 398.5 MB. Free memory was 345.9 MB in the beginning and 343.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:37:06,686 INFO L168 Benchmark]: RCFGBuilder took 139.63 ms. Allocated memory is still 398.5 MB. Free memory was 343.3 MB in the beginning and 328.7 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:37:06,686 INFO L168 Benchmark]: TraceAbstraction took 1342.33 ms. Allocated memory was 398.5 MB in the beginning and 599.3 MB in the end (delta: 200.8 MB). Free memory was 327.4 MB in the beginning and 431.4 MB in the end (delta: -104.1 MB). Peak memory consumption was 96.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:37:06,687 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.12 ms. Allocated memory is still 398.5 MB. Free memory is still 361.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 154.59 ms. Allocated memory is still 398.5 MB. Free memory was 355.1 MB in the beginning and 345.9 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.11 ms. Allocated memory is still 398.5 MB. Free memory was 345.9 MB in the beginning and 343.3 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 139.63 ms. Allocated memory is still 398.5 MB. Free memory was 343.3 MB in the beginning and 328.7 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1342.33 ms. Allocated memory was 398.5 MB in the beginning and 599.3 MB in the end (delta: 200.8 MB). Free memory was 327.4 MB in the beginning and 431.4 MB in the end (delta: -104.1 MB). Peak memory consumption was 96.7 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: UnsupportedOperationException: Unknown lemma type! de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: UnsupportedOperationException: Unknown lemma type!: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:299) RESULT: Ultimate could not prove your program: Toolchain returned no result. 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_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-37-06-694.csv Received shutdown request...