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/list-properties/list_true-unreach-call_false-valid-memtrack.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-26d9e06-m [2018-02-02 10:49:15,601 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-02 10:49:15,602 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-02 10:49:15,616 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-02 10:49:15,617 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-02 10:49:15,617 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-02 10:49:15,618 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-02 10:49:15,620 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-02 10:49:15,622 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-02 10:49:15,622 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-02 10:49:15,623 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-02 10:49:15,623 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-02 10:49:15,624 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-02 10:49:15,625 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-02 10:49:15,626 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-02 10:49:15,627 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-02 10:49:15,629 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-02 10:49:15,631 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-02 10:49:15,631 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-02 10:49:15,633 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-02 10:49:15,635 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-02 10:49:15,635 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-02 10:49:15,635 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-02 10:49:15,636 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-02 10:49:15,637 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-02 10:49:15,638 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-02 10:49:15,638 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-02 10:49:15,639 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-02 10:49:15,639 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-02 10:49:15,639 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-02 10:49:15,640 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-02 10:49:15,640 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:49:15,650 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-02 10:49:15,650 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-02 10:49:15,651 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-02 10:49:15,651 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-02 10:49:15,651 INFO L133 SettingsManager]: * Use SBE=true [2018-02-02 10:49:15,651 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-02 10:49:15,651 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-02 10:49:15,651 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-02 10:49:15,652 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-02 10:49:15,652 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-02 10:49:15,652 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-02 10:49:15,652 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-02 10:49:15,652 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-02 10:49:15,652 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-02-02 10:49:15,652 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-02 10:49:15,652 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-02 10:49:15,652 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-02 10:49:15,653 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-02 10:49:15,653 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-02 10:49:15,653 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-02 10:49:15,653 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-02 10:49:15,653 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-02 10:49:15,653 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-02-02 10:49:15,653 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol_NoArrayInterpol [2018-02-02 10:49:15,680 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-02 10:49:15,689 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-02 10:49:15,692 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-02 10:49:15,693 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-02 10:49:15,693 INFO L276 PluginConnector]: CDTParser initialized [2018-02-02 10:49:15,694 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-properties/list_true-unreach-call_false-valid-memtrack.i [2018-02-02 10:49:15,820 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-02 10:49:15,822 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-02 10:49:15,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-02 10:49:15,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-02 10:49:15,827 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-02 10:49:15,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:49:15" (1/1) ... [2018-02-02 10:49:15,829 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:49:15, skipping insertion in model container [2018-02-02 10:49:15,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.02 10:49:15" (1/1) ... [2018-02-02 10:49:15,843 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:49:15,871 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-02 10:49:15,959 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:49:15,976 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-02 10:49:15,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:15 WrapperNode [2018-02-02 10:49:15,983 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-02 10:49:15,984 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-02 10:49:15,984 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-02 10:49:15,984 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-02 10:49:15,997 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:15" (1/1) ... [2018-02-02 10:49:15,997 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:15" (1/1) ... [2018-02-02 10:49:16,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:15" (1/1) ... [2018-02-02 10:49:16,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:15" (1/1) ... [2018-02-02 10:49:16,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:15" (1/1) ... [2018-02-02 10:49:16,013 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:15" (1/1) ... [2018-02-02 10:49:16,014 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:15" (1/1) ... [2018-02-02 10:49:16,015 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-02 10:49:16,016 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-02 10:49:16,016 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-02 10:49:16,016 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-02 10:49:16,017 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:15" (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:49:16,058 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-02 10:49:16,058 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-02 10:49:16,058 INFO L136 BoogieDeclarations]: Found implementation of procedure exit [2018-02-02 10:49:16,058 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-02 10:49:16,058 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-02 10:49:16,058 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-02 10:49:16,059 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-02 10:49:16,059 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-02 10:49:16,059 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-02 10:49:16,059 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-02 10:49:16,059 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-02 10:49:16,059 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2018-02-02 10:49:16,059 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-02 10:49:16,059 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-02 10:49:16,059 INFO L128 BoogieDeclarations]: Found specification of procedure exit [2018-02-02 10:49:16,060 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-02 10:49:16,060 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-02 10:49:16,060 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-02 10:49:16,312 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-02 10:49:16,313 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:49:16 BoogieIcfgContainer [2018-02-02 10:49:16,313 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-02 10:49:16,313 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-02 10:49:16,313 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-02 10:49:16,315 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-02 10:49:16,315 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.02 10:49:15" (1/3) ... [2018-02-02 10:49:16,315 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb3079a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:49:16, skipping insertion in model container [2018-02-02 10:49:16,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.02 10:49:15" (2/3) ... [2018-02-02 10:49:16,316 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fb3079a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.02 10:49:16, skipping insertion in model container [2018-02-02 10:49:16,316 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.02 10:49:16" (3/3) ... [2018-02-02 10:49:16,317 INFO L107 eAbstractionObserver]: Analyzing ICFG list_true-unreach-call_false-valid-memtrack.i [2018-02-02 10:49:16,322 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-02-02 10:49:16,327 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-02-02 10:49:16,355 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-02 10:49:16,356 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-02 10:49:16,356 INFO L324 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-02-02 10:49:16,356 INFO L325 AbstractCegarLoop]: Backedges is CANONICAL [2018-02-02 10:49:16,356 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-02 10:49:16,356 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-02 10:49:16,356 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-02 10:49:16,356 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-02 10:49:16,357 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-02 10:49:16,367 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states. [2018-02-02 10:49:16,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-02 10:49:16,375 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:49:16,376 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:49:16,376 INFO L371 AbstractCegarLoop]: === Iteration 1 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:49:16,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1577909781, now seen corresponding path program 1 times [2018-02-02 10:49:16,415 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:49:16,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:49:16,445 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:49:16,473 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:49:16,474 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:49:16,475 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-02 10:49:16,475 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:49:16,476 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:49:16,476 INFO L182 omatonBuilderFactory]: Interpolants [82#true, 83#false] [2018-02-02 10:49:16,476 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:49:16,477 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-02 10:49:16,485 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-02 10:49:16,485 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 10:49:16,487 INFO L87 Difference]: Start difference. First operand 79 states. Second operand 2 states. [2018-02-02 10:49:16,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:49:16,503 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2018-02-02 10:49:16,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-02 10:49:16,565 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-02-02 10:49:16,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:49:16,570 INFO L225 Difference]: With dead ends: 79 [2018-02-02 10:49:16,572 INFO L226 Difference]: Without dead ends: 70 [2018-02-02 10:49:16,573 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-02 10:49:16,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-02-02 10:49:16,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2018-02-02 10:49:16,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-02-02 10:49:16,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2018-02-02 10:49:16,600 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 12 [2018-02-02 10:49:16,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:49:16,600 INFO L432 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2018-02-02 10:49:16,600 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-02 10:49:16,600 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2018-02-02 10:49:16,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 10:49:16,601 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:49:16,601 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:49:16,601 INFO L371 AbstractCegarLoop]: === Iteration 2 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:49:16,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1669671355, now seen corresponding path program 1 times [2018-02-02 10:49:16,602 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:49:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:49:16,616 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:49:16,682 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:49:16,683 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:49:16,683 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:49:16,683 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:49:16,683 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:49:16,683 INFO L182 omatonBuilderFactory]: Interpolants [233#true, 234#false, 235#(= 1 (select |#valid| |main_#t~malloc0.base|)), 236#(= 1 (select |#valid| main_~a~0.base)), 237#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:49:16,684 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:49:16,685 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:49:16,685 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:49:16,685 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:49:16,685 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand 5 states. [2018-02-02 10:49:16,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:49:16,806 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2018-02-02 10:49:16,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:49:16,807 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-02 10:49:16,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:49:16,808 INFO L225 Difference]: With dead ends: 81 [2018-02-02 10:49:16,808 INFO L226 Difference]: Without dead ends: 81 [2018-02-02 10:49:16,809 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:49:16,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-02-02 10:49:16,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 76. [2018-02-02 10:49:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-02-02 10:49:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 86 transitions. [2018-02-02 10:49:16,815 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 86 transitions. Word has length 13 [2018-02-02 10:49:16,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:49:16,816 INFO L432 AbstractCegarLoop]: Abstraction has 76 states and 86 transitions. [2018-02-02 10:49:16,816 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:49:16,816 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 86 transitions. [2018-02-02 10:49:16,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-02-02 10:49:16,817 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:49:16,817 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:49:16,817 INFO L371 AbstractCegarLoop]: === Iteration 3 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:49:16,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1669671356, now seen corresponding path program 1 times [2018-02-02 10:49:16,818 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:49:16,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:49:16,830 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:49:16,894 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:49:16,895 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:49:16,895 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-02 10:49:16,895 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:49:16,895 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:49:16,895 INFO L182 omatonBuilderFactory]: Interpolants [400#false, 401#(and (= 8 (select |#length| |main_#t~malloc0.base|)) (= 0 |main_#t~malloc0.offset|)), 402#(and (= 8 (select |#length| main_~a~0.base)) (= 0 main_~a~0.offset)), 403#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 399#true] [2018-02-02 10:49:16,895 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:49:16,896 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-02 10:49:16,896 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-02 10:49:16,896 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-02 10:49:16,896 INFO L87 Difference]: Start difference. First operand 76 states and 86 transitions. Second operand 5 states. [2018-02-02 10:49:17,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:49:17,045 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2018-02-02 10:49:17,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-02 10:49:17,045 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2018-02-02 10:49:17,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:49:17,046 INFO L225 Difference]: With dead ends: 102 [2018-02-02 10:49:17,046 INFO L226 Difference]: Without dead ends: 102 [2018-02-02 10:49:17,047 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:49:17,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-02-02 10:49:17,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2018-02-02 10:49:17,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-02-02 10:49:17,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2018-02-02 10:49:17,053 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 13 [2018-02-02 10:49:17,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:49:17,053 INFO L432 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2018-02-02 10:49:17,053 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-02 10:49:17,053 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2018-02-02 10:49:17,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:49:17,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:49:17,054 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:49:17,054 INFO L371 AbstractCegarLoop]: === Iteration 4 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:49:17,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1462598724, now seen corresponding path program 1 times [2018-02-02 10:49:17,056 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:49:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:49:17,067 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:49:17,115 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:49:17,115 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:49:17,115 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:49:17,116 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:49:17,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:49:17,116 INFO L182 omatonBuilderFactory]: Interpolants [608#(= 1 (select |#valid| |main_#t~mem5.base|)), 609#(= 1 (select |#valid| main_~p~0.base)), 603#true, 604#false, 605#(= 1 (select |#valid| |main_#t~malloc3.base|)), 606#(= 1 (select |#valid| main_~t~0.base)), 607#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4))))] [2018-02-02 10:49:17,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:49:17,116 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:49:17,117 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:49:17,117 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:49:17,117 INFO L87 Difference]: Start difference. First operand 93 states and 101 transitions. Second operand 7 states. [2018-02-02 10:49:17,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:49:17,440 INFO L93 Difference]: Finished difference Result 189 states and 204 transitions. [2018-02-02 10:49:17,440 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:49:17,441 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-02 10:49:17,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:49:17,441 INFO L225 Difference]: With dead ends: 189 [2018-02-02 10:49:17,442 INFO L226 Difference]: Without dead ends: 189 [2018-02-02 10:49:17,442 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:49:17,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-02-02 10:49:17,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 97. [2018-02-02 10:49:17,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-02-02 10:49:17,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 108 transitions. [2018-02-02 10:49:17,446 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 108 transitions. Word has length 23 [2018-02-02 10:49:17,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:49:17,446 INFO L432 AbstractCegarLoop]: Abstraction has 97 states and 108 transitions. [2018-02-02 10:49:17,446 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:49:17,446 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 108 transitions. [2018-02-02 10:49:17,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-02-02 10:49:17,447 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:49:17,447 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:49:17,447 INFO L371 AbstractCegarLoop]: === Iteration 5 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:49:17,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1462598725, now seen corresponding path program 1 times [2018-02-02 10:49:17,448 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:49:17,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:49:17,457 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:49:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:49:17,535 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:49:17,535 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:49:17,535 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:49:17,535 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:49:17,535 INFO L182 omatonBuilderFactory]: Interpolants [912#(and (= 8 (select |#length| |main_#t~mem5.base|)) (= 0 |main_#t~mem5.offset|)), 913#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 907#true, 908#false, 909#(and (= 8 (select |#length| |main_#t~malloc3.base|)) (= 0 |main_#t~malloc3.offset|)), 910#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 911#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4))))] [2018-02-02 10:49:17,535 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:49:17,536 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:49:17,536 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:49:17,536 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:49:17,536 INFO L87 Difference]: Start difference. First operand 97 states and 108 transitions. Second operand 7 states. [2018-02-02 10:49:17,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:49:17,877 INFO L93 Difference]: Finished difference Result 186 states and 204 transitions. [2018-02-02 10:49:17,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-02 10:49:17,878 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-02-02 10:49:17,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:49:17,879 INFO L225 Difference]: With dead ends: 186 [2018-02-02 10:49:17,879 INFO L226 Difference]: Without dead ends: 186 [2018-02-02 10:49:17,880 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2018-02-02 10:49:17,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-02-02 10:49:17,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 80. [2018-02-02 10:49:17,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-02-02 10:49:17,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2018-02-02 10:49:17,888 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 23 [2018-02-02 10:49:17,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:49:17,888 INFO L432 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2018-02-02 10:49:17,888 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:49:17,889 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2018-02-02 10:49:17,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-02 10:49:17,889 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:49:17,889 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] [2018-02-02 10:49:17,890 INFO L371 AbstractCegarLoop]: === Iteration 6 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:49:17,890 INFO L82 PathProgramCache]: Analyzing trace with hash 919312261, now seen corresponding path program 1 times [2018-02-02 10:49:17,890 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:49:17,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:49:17,900 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:49:17,946 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:49:17,946 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:49:17,946 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:49:17,947 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:49:17,947 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:49:17,947 INFO L182 omatonBuilderFactory]: Interpolants [1200#(= |main_#t~mem12| 3), 1195#true, 1196#false, 1197#(and (= main_~p~0.offset main_~a~0.offset) (= main_~p~0.base main_~a~0.base)), 1198#(= (select (select |#memory_int| main_~a~0.base) main_~a~0.offset) 3), 1199#(= (select (select |#memory_int| main_~p~0.base) main_~p~0.offset) 3)] [2018-02-02 10:49:17,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:49:17,947 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-02 10:49:17,947 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-02 10:49:17,947 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-02-02 10:49:17,948 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand 6 states. [2018-02-02 10:49:18,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:49:18,047 INFO L93 Difference]: Finished difference Result 135 states and 143 transitions. [2018-02-02 10:49:18,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-02 10:49:18,047 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-02-02 10:49:18,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:49:18,048 INFO L225 Difference]: With dead ends: 135 [2018-02-02 10:49:18,048 INFO L226 Difference]: Without dead ends: 135 [2018-02-02 10:49:18,049 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-02 10:49:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-02-02 10:49:18,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 91. [2018-02-02 10:49:18,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-02-02 10:49:18,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 100 transitions. [2018-02-02 10:49:18,053 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 100 transitions. Word has length 24 [2018-02-02 10:49:18,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:49:18,054 INFO L432 AbstractCegarLoop]: Abstraction has 91 states and 100 transitions. [2018-02-02 10:49:18,054 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-02 10:49:18,054 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 100 transitions. [2018-02-02 10:49:18,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:49:18,054 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:49:18,054 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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:49:18,055 INFO L371 AbstractCegarLoop]: === Iteration 7 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:49:18,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1842256062, now seen corresponding path program 1 times [2018-02-02 10:49:18,055 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:49:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:49:18,064 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:49:18,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:49:18,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:49:18,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:49:18,104 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:49:18,104 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:49:18,105 INFO L182 omatonBuilderFactory]: Interpolants [1431#true, 1432#false, 1433#(= 1 (select |#valid| |main_#t~malloc8.base|)), 1434#(= 1 (select |#valid| main_~t~0.base)), 1435#(= 1 (select |#valid| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))), 1436#(= 1 (select |#valid| |main_#t~mem10.base|)), 1437#(= 1 (select |#valid| main_~p~0.base))] [2018-02-02 10:49:18,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:49:18,105 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:49:18,105 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:49:18,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:49:18,105 INFO L87 Difference]: Start difference. First operand 91 states and 100 transitions. Second operand 7 states. [2018-02-02 10:49:18,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:49:18,203 INFO L93 Difference]: Finished difference Result 125 states and 136 transitions. [2018-02-02 10:49:18,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-02-02 10:49:18,203 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 10:49:18,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:49:18,204 INFO L225 Difference]: With dead ends: 125 [2018-02-02 10:49:18,204 INFO L226 Difference]: Without dead ends: 125 [2018-02-02 10:49:18,204 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-02-02 10:49:18,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-02-02 10:49:18,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 89. [2018-02-02 10:49:18,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-02-02 10:49:18,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 98 transitions. [2018-02-02 10:49:18,208 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 98 transitions. Word has length 26 [2018-02-02 10:49:18,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:49:18,208 INFO L432 AbstractCegarLoop]: Abstraction has 89 states and 98 transitions. [2018-02-02 10:49:18,208 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:49:18,208 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 98 transitions. [2018-02-02 10:49:18,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-02 10:49:18,209 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:49:18,209 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 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:49:18,209 INFO L371 AbstractCegarLoop]: === Iteration 8 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:49:18,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1842256063, now seen corresponding path program 1 times [2018-02-02 10:49:18,210 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:49:18,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-02 10:49:18,219 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-02 10:49:18,286 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:49:18,286 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-02 10:49:18,286 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-02 10:49:18,286 INFO L142 lantAutomatonBuilder]: Constructing canonical interpolant automaton, with selfloop in false state [2018-02-02 10:49:18,286 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:49:18,286 INFO L182 omatonBuilderFactory]: Interpolants [1664#false, 1665#(and (= 8 (select |#length| |main_#t~malloc8.base|)) (= 0 |main_#t~malloc8.offset|)), 1666#(and (= 8 (select |#length| main_~t~0.base)) (= 0 main_~t~0.offset)), 1667#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| main_~p~0.base) (+ main_~p~0.offset 4)))) (= 0 (select (select |#memory_$Pointer$.offset| main_~p~0.base) (+ main_~p~0.offset 4)))), 1668#(and (= 8 (select |#length| |main_#t~mem10.base|)) (= 0 |main_#t~mem10.offset|)), 1669#(and (= (select |#length| main_~p~0.base) 8) (= main_~p~0.offset 0)), 1663#true] [2018-02-02 10:49:18,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-02 10:49:18,287 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-02 10:49:18,287 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-02 10:49:18,287 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-02-02 10:49:18,287 INFO L87 Difference]: Start difference. First operand 89 states and 98 transitions. Second operand 7 states. [2018-02-02 10:49:18,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-02 10:49:18,421 INFO L93 Difference]: Finished difference Result 120 states and 133 transitions. [2018-02-02 10:49:18,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-02-02 10:49:18,421 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-02-02 10:49:18,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-02 10:49:18,422 INFO L225 Difference]: With dead ends: 120 [2018-02-02 10:49:18,422 INFO L226 Difference]: Without dead ends: 120 [2018-02-02 10:49:18,423 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2018-02-02 10:49:18,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-02-02 10:49:18,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 75. [2018-02-02 10:49:18,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-02 10:49:18,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 83 transitions. [2018-02-02 10:49:18,426 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 83 transitions. Word has length 26 [2018-02-02 10:49:18,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-02 10:49:18,426 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 83 transitions. [2018-02-02 10:49:18,426 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-02 10:49:18,426 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 83 transitions. [2018-02-02 10:49:18,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-02 10:49:18,427 INFO L343 BasicCegarLoop]: Found error trace [2018-02-02 10:49:18,427 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-02 10:49:18,427 INFO L371 AbstractCegarLoop]: === Iteration 9 === [mainErr5RequiresViolation, mainErr13RequiresViolation, mainErr18RequiresViolation, mainErr23RequiresViolation, mainErr0RequiresViolation, mainErr21RequiresViolation, mainErr3RequiresViolation, mainErr15RequiresViolation, mainErr16RequiresViolation, mainErr2RequiresViolation, mainErr12RequiresViolation, mainErr6RequiresViolation, mainErr19RequiresViolation, mainErr22RequiresViolation, mainErr1RequiresViolation, mainErr17RequiresViolation, mainErr9RequiresViolation, mainErr24EnsuresViolation, mainErr7RequiresViolation, mainErr20RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr4RequiresViolation, mainErr14RequiresViolation]=== [2018-02-02 10:49:18,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1313779944, now seen corresponding path program 1 times [2018-02-02 10:49:18,428 INFO L67 tionRefinementEngine]: Using refinement strategy FixedTraceAbstractionRefinementStrategy [2018-02-02 10:49:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 10:49:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-02 10:49:18,459 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-02 10:49:18,470 WARN L343 cessorBacktranslator]: Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) [2018-02-02 10:49:18,483 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.02 10:49:18 BoogieIcfgContainer [2018-02-02 10:49:18,483 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-02 10:49:18,484 INFO L168 Benchmark]: Toolchain (without parser) took 2662.99 ms. Allocated memory was 404.8 MB in the beginning and 632.8 MB in the end (delta: 228.1 MB). Free memory was 361.4 MB in the beginning and 430.9 MB in the end (delta: -69.5 MB). Peak memory consumption was 158.6 MB. Max. memory is 5.3 GB. [2018-02-02 10:49:18,485 INFO L168 Benchmark]: CDTParser took 0.12 ms. Allocated memory is still 404.8 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-02 10:49:18,485 INFO L168 Benchmark]: CACSL2BoogieTranslator took 161.28 ms. Allocated memory is still 404.8 MB. Free memory was 361.4 MB in the beginning and 350.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-02 10:49:18,486 INFO L168 Benchmark]: Boogie Preprocessor took 31.35 ms. Allocated memory is still 404.8 MB. Free memory was 350.7 MB in the beginning and 349.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-02 10:49:18,486 INFO L168 Benchmark]: RCFGBuilder took 297.08 ms. Allocated memory is still 404.8 MB. Free memory was 349.4 MB in the beginning and 322.9 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. [2018-02-02 10:49:18,486 INFO L168 Benchmark]: TraceAbstraction took 2170.19 ms. Allocated memory was 404.8 MB in the beginning and 632.8 MB in the end (delta: 228.1 MB). Free memory was 322.9 MB in the beginning and 430.9 MB in the end (delta: -108.1 MB). Peak memory consumption was 120.0 MB. Max. memory is 5.3 GB. [2018-02-02 10:49:18,487 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 404.8 MB. Free memory is still 368.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 161.28 ms. Allocated memory is still 404.8 MB. Free memory was 361.4 MB in the beginning and 350.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 31.35 ms. Allocated memory is still 404.8 MB. Free memory was 350.7 MB in the beginning and 349.4 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 297.08 ms. Allocated memory is still 404.8 MB. Free memory was 349.4 MB in the beginning and 322.9 MB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2170.19 ms. Allocated memory was 404.8 MB in the beginning and 632.8 MB in the end (delta: 228.1 MB). Free memory was 322.9 MB in the beginning and 430.9 MB in the end (delta: -108.1 MB). Peak memory consumption was 120.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Generated EnsuresSpecification ensures #valid == old(#valid); is not ensure(true) * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 626]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 626. Possible FailurePath: [L627] EXPR, FCALL malloc(sizeof(struct node)) VAL [malloc(sizeof(struct node))={11:0}] [L627] List a = (List) malloc(sizeof(struct node)); VAL [a={11:0}, malloc(sizeof(struct node))={11:0}] [L628] COND FALSE !(a == 0) VAL [a={11:0}, malloc(sizeof(struct node))={11:0}] [L629] List t; [L630] List p = a; VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] [L631] COND FALSE !(__VERIFIER_nondet_int()) [L638] COND FALSE !(__VERIFIER_nondet_int()) [L645] FCALL p->h = 3 VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] [L646] p = a VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] [L647] EXPR, FCALL p->h VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}, p->h=3] [L647] COND FALSE !(p->h == 1) [L649] EXPR, FCALL p->h VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}, p->h=3] [L649] COND FALSE !(p->h == 2) [L651] EXPR, FCALL p->h VAL [a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}, p->h=3] [L651] COND FALSE !(p->h != 3) [L653] return 0; VAL [\result=0, a={11:0}, malloc(sizeof(struct node))={11:0}, p={11:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 81 locations, 25 error locations. UNSAFE Result, 2.1s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 1.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 464 SDtfs, 984 SDslu, 997 SDs, 0 SdLazy, 1156 SolverSat, 107 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 73 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=97occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 16/16 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 337 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 187 NumberOfCodeBlocks, 187 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 152 ConstructedInterpolants, 0 QuantifiedInterpolants, 11512 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 8 InterpolantComputations, 8 PerfectInterpolantSequences, 16/16 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-02_10-49-18-493.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/list_true-unreach-call_false-valid-memtrack.i_svcomp-DerefFreeMemtrack-32bit-Automizer_SmtInterpol_NoArray.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-02_10-49-18-493.csv Received shutdown request...