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/stroeder2-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:37:05,270 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:37:05,271 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:37:05,280 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:37:05,281 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:37:05,281 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:37:05,282 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:37:05,284 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:37:05,285 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:37:05,285 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:37:05,286 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:37:05,286 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:37:05,287 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:37:05,288 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:37:05,288 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:37:05,290 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:37:05,292 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:37:05,293 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:37:05,294 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:37:05,295 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:37:05,297 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:37:05,297 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:37:05,297 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:37:05,298 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:37:05,299 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:37:05,299 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:37:05,300 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:37:05,300 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:37:05,300 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:37:05,300 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:37:05,301 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:37:05,301 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:05,311 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:37:05,311 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:37:05,312 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:37:05,312 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:37:05,312 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:37:05,312 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:37:05,313 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:37:05,313 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:37:05,313 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:37:05,313 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:37:05,313 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:37:05,313 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:37:05,313 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:37:05,314 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:37:05,314 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:37:05,314 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:37:05,314 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:37:05,314 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:37:05,314 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:37:05,315 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:37:05,315 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:37:05,315 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:37:05,315 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:37:05,315 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:37:05,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:37:05,358 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:37:05,361 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:37:05,363 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:37:05,363 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:37:05,364 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:37:05,494 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:37:05,496 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:37:05,497 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:37:05,497 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:37:05,503 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:37:05,504 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,507 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b546732 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,507 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,524 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:37:05,553 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:37:05,640 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:37:05,651 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:37:05,654 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,655 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:37:05,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:37:05,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:37:05,655 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:37:05,663 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,664 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,673 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,673 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,675 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,678 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,678 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,679 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:37:05,680 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:37:05,680 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:37:05,680 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:37:05,681 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,717 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:37:05,718 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:37:05,718 INFO L136 BoogieDeclarations]: Found implementation of procedure sumOfThirdBytes [2018-02-02 10:37:05,718 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:37:05,718 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:37:05,718 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:37:05,718 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:37:05,718 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:37:05,718 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:37:05,718 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:37:05,719 INFO L128 BoogieDeclarations]: Found specification of procedure sumOfThirdBytes [2018-02-02 10:37:05,719 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:37:05,719 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:37:05,719 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:37:05,851 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:37:05,852 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,852 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:37:05,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:37:05,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:37:05,855 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:37:05,855 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,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300987c6 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,856 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,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@300987c6 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,856 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,858 INFO L107 eAbstractionObserver]: Analyzing ICFG stroeder2-alloca_true-valid-memsafety_true-termination.i [2018-02-02 10:37:05,863 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:37:05,868 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 7 error locations. [2018-02-02 10:37:05,893 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:37:05,893 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:37:05,893 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:37:05,893 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:37:05,894 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:37:05,894 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:37:05,894 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:37:05,894 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:37:05,895 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:37:05,906 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-02-02 10:37:05,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:37:05,913 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:05,914 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:05,914 INFO L371 AbstractCegarLoop]: === Iteration 1 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:37:05,917 INFO L82 PathProgramCache]: Analyzing trace with hash -55325045, now seen corresponding path program 1 times [2018-02-02 10:37:05,955 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:05,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:05,999 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,109 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,112 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:37:06,112 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:37:06,115 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:06,115 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,115 INFO L182 omatonBuilderFactory]: Interpolants [41#true, 42#false, 43#(= 1 (select |#valid| |main_#t~malloc6.base|)), 44#(= 1 (select |#valid| main_~numbers~0.base)), 45#(= 1 (select |#valid| |sumOfThirdBytes_#in~numbers.base|)), 46#(= 1 (select |#valid| |sumOfThirdBytes_~#numbers.base|)), 47#(= 1 (select |#valid| sumOfThirdBytes_~p~0.base))] [2018-02-02 10:37:06,116 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,117 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:37:06,130 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:37:06,130 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:37:06,132 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 7 states. [2018-02-02 10:37:06,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:06,279 INFO L93 Difference]: Finished difference Result 40 states and 43 transitions. [2018-02-02 10:37:06,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:37:06,281 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-02-02 10:37:06,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:06,336 INFO L225 Difference]: With dead ends: 40 [2018-02-02 10:37:06,337 INFO L226 Difference]: Without dead ends: 37 [2018-02-02 10:37:06,338 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-02 10:37:06,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-02-02 10:37:06,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 32. [2018-02-02 10:37:06,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-02-02 10:37:06,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2018-02-02 10:37:06,368 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 15 [2018-02-02 10:37:06,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:06,369 INFO L432 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2018-02-02 10:37:06,369 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:37:06,369 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2018-02-02 10:37:06,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-02-02 10:37:06,370 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:06,370 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:06,370 INFO L371 AbstractCegarLoop]: === Iteration 2 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:37:06,370 INFO L82 PathProgramCache]: Analyzing trace with hash -55325044, now seen corresponding path program 1 times [2018-02-02 10:37:06,371 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:06,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:06,389 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,491 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,492 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:37:06,492 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:37:06,492 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:06,492 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,492 INFO L182 omatonBuilderFactory]: Interpolants [128#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc6.base|)) (= 0 |main_#t~malloc6.offset|)), 129#(and (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base))), 130#(and (= 0 |sumOfThirdBytes_#in~numbers.offset|) (<= (* 4 |sumOfThirdBytes_#in~array_size|) (select |#length| |sumOfThirdBytes_#in~numbers.base|))), 131#(and (= sumOfThirdBytes_~i~0 0) (<= (* 4 sumOfThirdBytes_~array_size) (select |#length| |sumOfThirdBytes_~#numbers.base|)) (= |sumOfThirdBytes_~#numbers.offset| 0)), 132#(and (<= 2 sumOfThirdBytes_~p~0.offset) (<= (+ sumOfThirdBytes_~p~0.offset 2) (select |#length| sumOfThirdBytes_~p~0.base))), 126#true, 127#false] [2018-02-02 10:37:06,493 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,494 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:37:06,494 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:37:06,494 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:37:06,495 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand 7 states. [2018-02-02 10:37:06,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:06,635 INFO L93 Difference]: Finished difference Result 50 states and 55 transitions. [2018-02-02 10:37:06,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:37:06,635 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 15 [2018-02-02 10:37:06,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:06,636 INFO L225 Difference]: With dead ends: 50 [2018-02-02 10:37:06,636 INFO L226 Difference]: Without dead ends: 50 [2018-02-02 10:37:06,637 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-02 10:37:06,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-02-02 10:37:06,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 41. [2018-02-02 10:37:06,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 10:37:06,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 45 transitions. [2018-02-02 10:37:06,642 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 45 transitions. Word has length 15 [2018-02-02 10:37:06,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:06,643 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 45 transitions. [2018-02-02 10:37:06,643 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:37:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 45 transitions. [2018-02-02 10:37:06,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-02 10:37:06,644 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:06,644 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,644 INFO L371 AbstractCegarLoop]: === Iteration 3 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:37:06,644 INFO L82 PathProgramCache]: Analyzing trace with hash -195737667, now seen corresponding path program 1 times [2018-02-02 10:37:06,645 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:06,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:06,656 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,691 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,692 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:37:06,692 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-02 10:37:06,692 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:06,692 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,692 INFO L182 omatonBuilderFactory]: Interpolants [232#true, 233#false, 234#(<= 1 main_~array_size~0), 235#(and (= sumOfThirdBytes_~i~0 0) (<= |sumOfThirdBytes_#in~array_size| sumOfThirdBytes_~array_size)), 236#(<= |sumOfThirdBytes_#in~array_size| 0)] [2018-02-02 10:37:06,693 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,693 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:37:06,693 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:37:06,693 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:37:06,693 INFO L87 Difference]: Start difference. First operand 41 states and 45 transitions. Second operand 5 states. [2018-02-02 10:37:06,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:06,714 INFO L93 Difference]: Finished difference Result 45 states and 48 transitions. [2018-02-02 10:37:06,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:37:06,715 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-02-02 10:37:06,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:06,715 INFO L225 Difference]: With dead ends: 45 [2018-02-02 10:37:06,715 INFO L226 Difference]: Without dead ends: 42 [2018-02-02 10:37:06,716 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,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-02-02 10:37:06,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-02-02 10:37:06,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-02-02 10:37:06,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 44 transitions. [2018-02-02 10:37:06,719 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 44 transitions. Word has length 20 [2018-02-02 10:37:06,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:06,720 INFO L432 AbstractCegarLoop]: Abstraction has 41 states and 44 transitions. [2018-02-02 10:37:06,720 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:37:06,720 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 44 transitions. [2018-02-02 10:37:06,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:37:06,720 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:06,721 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:06,721 INFO L371 AbstractCegarLoop]: === Iteration 4 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:37:06,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1506152513, now seen corresponding path program 1 times [2018-02-02 10:37:06,722 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:06,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:06,732 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,820 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:06,821 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:06,821 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-02-02 10:37:06,821 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:06,821 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,822 INFO L182 omatonBuilderFactory]: Interpolants [325#true, 326#false, 327#(<= main_~array_size~0 1), 328#(and (<= main_~array_size~0 1) (= 0 |main_#t~malloc6.offset|)), 329#(and (<= main_~array_size~0 1) (= 0 main_~numbers~0.offset)), 330#(and (= 0 |sumOfThirdBytes_#in~numbers.offset|) (<= |sumOfThirdBytes_#in~array_size| 1)), 331#(and (<= sumOfThirdBytes_~array_size 1) (= |sumOfThirdBytes_~#numbers.offset| 0)), 332#(and (<= (+ sumOfThirdBytes_~p~0.offset (* 4 sumOfThirdBytes_~array_size)) (+ (* 4 sumOfThirdBytes_~i~0) |sumOfThirdBytes_~#numbers.offset| 6)) (= |sumOfThirdBytes_~#numbers.offset| 0)), 333#(and (<= (* 4 sumOfThirdBytes_~array_size) (+ (* 4 sumOfThirdBytes_~i~0) |sumOfThirdBytes_~#numbers.offset| 6)) (= |sumOfThirdBytes_~#numbers.offset| 0)), 334#(and (<= (* 4 sumOfThirdBytes_~array_size) (+ (* 4 sumOfThirdBytes_~i~0) |sumOfThirdBytes_~#numbers.offset| 2)) (= |sumOfThirdBytes_~#numbers.offset| 0))] [2018-02-02 10:37:06,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:06,822 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:37:06,822 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:37:06,823 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:37:06,823 INFO L87 Difference]: Start difference. First operand 41 states and 44 transitions. Second operand 10 states. [2018-02-02 10:37:06,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:06,910 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2018-02-02 10:37:06,910 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:37:06,910 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-02-02 10:37:06,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:06,911 INFO L225 Difference]: With dead ends: 65 [2018-02-02 10:37:06,911 INFO L226 Difference]: Without dead ends: 65 [2018-02-02 10:37:06,911 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:37:06,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-02-02 10:37:06,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2018-02-02 10:37:06,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-02-02 10:37:06,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2018-02-02 10:37:06,914 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 21 [2018-02-02 10:37:06,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:06,915 INFO L432 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2018-02-02 10:37:06,915 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:37:06,915 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2018-02-02 10:37:06,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-02-02 10:37:06,915 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:06,915 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:37:06,915 INFO L371 AbstractCegarLoop]: === Iteration 5 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:37:06,915 INFO L82 PathProgramCache]: Analyzing trace with hash 226288835, now seen corresponding path program 1 times [2018-02-02 10:37:06,916 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:06,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:06,923 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:07,013 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:07,013 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-02-02 10:37:07,014 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-02-02 10:37:07,014 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:37:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:07,014 INFO L182 omatonBuilderFactory]: Interpolants [468#true, 469#false, 470#(and (= (* 4 main_~array_size~0) (select |#length| |main_#t~malloc6.base|)) (= 0 |main_#t~malloc6.offset|)), 471#(and (= 0 main_~numbers~0.offset) (= (* 4 main_~array_size~0) (select |#length| main_~numbers~0.base))), 472#(and (= 0 |sumOfThirdBytes_#in~numbers.offset|) (<= (* 4 |sumOfThirdBytes_#in~array_size|) (select |#length| |sumOfThirdBytes_#in~numbers.base|))), 473#(and (<= (* 4 sumOfThirdBytes_~array_size) (select |#length| |sumOfThirdBytes_~#numbers.base|)) (= |sumOfThirdBytes_~#numbers.offset| 0)), 474#(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)), 475#(and (<= 0 (+ (* 4 sumOfThirdBytes_~i~0) |sumOfThirdBytes_~#numbers.offset| 2)) (<= (* 4 sumOfThirdBytes_~array_size) (select |#length| |sumOfThirdBytes_~#numbers.base|)) (= |sumOfThirdBytes_~#numbers.offset| 0)), 476#(and (<= 2 (+ (* 4 sumOfThirdBytes_~i~0) |sumOfThirdBytes_~#numbers.offset|)) (<= (* 4 sumOfThirdBytes_~array_size) (select |#length| |sumOfThirdBytes_~#numbers.base|)) (= |sumOfThirdBytes_~#numbers.offset| 0)), 477#(and (<= 4 sumOfThirdBytes_~p~0.offset) (<= (+ sumOfThirdBytes_~p~0.offset 2) (select |#length| sumOfThirdBytes_~p~0.base)))] [2018-02-02 10:37:07,014 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:37:07,015 INFO L409 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-02-02 10:37:07,015 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-02-02 10:37:07,015 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-02-02 10:37:07,015 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand 10 states. [2018-02-02 10:37:07,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:37:07,160 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2018-02-02 10:37:07,160 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:37:07,160 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-02-02 10:37:07,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:37:07,161 INFO L225 Difference]: With dead ends: 63 [2018-02-02 10:37:07,161 INFO L226 Difference]: Without dead ends: 63 [2018-02-02 10:37:07,161 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:07,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-02-02 10:37:07,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 50. [2018-02-02 10:37:07,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-02-02 10:37:07,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 53 transitions. [2018-02-02 10:37:07,165 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 53 transitions. Word has length 21 [2018-02-02 10:37:07,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:37:07,165 INFO L432 AbstractCegarLoop]: Abstraction has 50 states and 53 transitions. [2018-02-02 10:37:07,165 INFO L433 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-02-02 10:37:07,165 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 53 transitions. [2018-02-02 10:37:07,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:37:07,166 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:37:07,166 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, 1] [2018-02-02 10:37:07,166 INFO L371 AbstractCegarLoop]: === Iteration 6 === [sumOfThirdBytesErr1RequiresViolation, sumOfThirdBytesErr4RequiresViolation, sumOfThirdBytesErr5RequiresViolation, sumOfThirdBytesErr0RequiresViolation, sumOfThirdBytesErr3RequiresViolation, sumOfThirdBytesErr2RequiresViolation, mainErr0EnsuresViolation]=== [2018-02-02 10:37:07,167 INFO L82 PathProgramCache]: Analyzing trace with hash 308334376, now seen corresponding path program 1 times [2018-02-02 10:37:07,167 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:37:07,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:37:07,178 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:07,183 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:07,189 INFO L168 Benchmark]: Toolchain (without parser) took 1694.24 ms. Allocated memory was 397.4 MB in the beginning and 597.2 MB in the end (delta: 199.8 MB). Free memory was 355.4 MB in the beginning and 423.5 MB in the end (delta: -68.1 MB). Peak memory consumption was 131.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:37:07,190 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 397.4 MB. Free memory is still 360.7 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:37:07,190 INFO L168 Benchmark]: CACSL2BoogieTranslator took 158.39 ms. Allocated memory is still 397.4 MB. Free memory was 354.1 MB in the beginning and 344.8 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:07,191 INFO L168 Benchmark]: Boogie Preprocessor took 24.29 ms. Allocated memory is still 397.4 MB. Free memory was 344.8 MB in the beginning and 342.2 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:07,191 INFO L168 Benchmark]: RCFGBuilder took 172.59 ms. Allocated memory is still 397.4 MB. Free memory was 342.2 MB in the beginning and 324.9 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:37:07,191 INFO L168 Benchmark]: TraceAbstraction took 1335.92 ms. Allocated memory was 397.4 MB in the beginning and 597.2 MB in the end (delta: 199.8 MB). Free memory was 324.9 MB in the beginning and 423.5 MB in the end (delta: -98.7 MB). Peak memory consumption was 101.1 MB. Max. memory is 5.3 GB. [2018-02-02 10:37:07,192 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.18 ms. Allocated memory is still 397.4 MB. Free memory is still 360.7 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 158.39 ms. Allocated memory is still 397.4 MB. Free memory was 354.1 MB in the beginning and 344.8 MB in the end (delta: 9.3 MB). Peak memory consumption was 9.3 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 24.29 ms. Allocated memory is still 397.4 MB. Free memory was 344.8 MB in the beginning and 342.2 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 5.3 GB. * RCFGBuilder took 172.59 ms. Allocated memory is still 397.4 MB. Free memory was 342.2 MB in the beginning and 324.9 MB in the end (delta: 17.3 MB). Peak memory consumption was 17.3 MB. Max. memory is 5.3 GB. * TraceAbstraction took 1335.92 ms. Allocated memory was 397.4 MB in the beginning and 597.2 MB in the end (delta: 199.8 MB). Free memory was 324.9 MB in the beginning and 423.5 MB in the end (delta: -98.7 MB). Peak memory consumption was 101.1 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/stroeder2-alloca_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-37-07-198.csv Received shutdown request...