java -Xmx6000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data ./data --generate-csv --csv-dir ../../../releaseScripts/default/UAutomizer-linux/csv -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf -i ../../../trunk/examples/svcomp/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 13:28:05,597 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 13:28:05,598 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 13:28:05,609 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 13:28:05,609 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 13:28:05,610 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 13:28:05,610 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 13:28:05,611 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 13:28:05,613 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 13:28:05,613 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 13:28:05,614 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 13:28:05,615 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 13:28:05,615 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 13:28:05,616 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 13:28:05,617 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 13:28:05,619 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 13:28:05,620 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 13:28:05,622 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 13:28:05,623 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 13:28:05,623 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 13:28:05,625 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 13:28:05,626 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 13:28:05,626 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 13:28:05,627 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 13:28:05,627 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 13:28:05,628 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 13:28:05,628 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 13:28:05,629 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 13:28:05,629 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 13:28:05,629 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 13:28:05,630 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 13:28:05,630 INFO L98 SettingsManager]: Beginning loading settings from /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/cade18-smtinterpol/svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf [2018-02-04 13:28:05,639 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 13:28:05,640 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 13:28:05,640 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 13:28:05,641 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 13:28:05,641 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 13:28:05,641 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 13:28:05,641 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 13:28:05,641 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 13:28:05,641 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 13:28:05,642 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 13:28:05,642 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 13:28:05,642 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 13:28:05,642 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 13:28:05,642 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 13:28:05,642 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 13:28:05,643 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 13:28:05,643 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 13:28:05,643 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 13:28:05,643 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 13:28:05,643 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:28:05,643 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 13:28:05,644 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 13:28:05,644 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 13:28:05,644 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 13:28:05,671 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 13:28:05,680 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 13:28:05,683 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 13:28:05,685 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 13:28:05,685 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 13:28:05,685 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/test-0019_1_true-valid-memsafety_true-termination.i [2018-02-04 13:28:05,810 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 13:28:05,812 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 13:28:05,812 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 13:28:05,813 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 13:28:05,818 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 13:28:05,819 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:28:05" (1/1) ... [2018-02-04 13:28:05,821 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71d0b66d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:05, skipping insertion in model container [2018-02-04 13:28:05,821 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:28:05" (1/1) ... [2018-02-04 13:28:05,835 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:28:05,863 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:28:05,943 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:28:05,954 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:28:05,959 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:05 WrapperNode [2018-02-04 13:28:05,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 13:28:05,959 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 13:28:05,959 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 13:28:05,959 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 13:28:05,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:05" (1/1) ... [2018-02-04 13:28:05,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:05" (1/1) ... [2018-02-04 13:28:05,974 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:05" (1/1) ... [2018-02-04 13:28:05,975 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:05" (1/1) ... [2018-02-04 13:28:05,977 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:05" (1/1) ... [2018-02-04 13:28:05,978 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:05" (1/1) ... [2018-02-04 13:28:05,979 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:05" (1/1) ... [2018-02-04 13:28:05,980 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 13:28:05,981 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 13:28:05,981 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 13:28:05,981 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 13:28:05,982 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28: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-04 13:28:06,014 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 13:28:06,014 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 13:28:06,014 INFO L136 BoogieDeclarations]: Found implementation of procedure alloc_data [2018-02-04 13:28:06,014 INFO L136 BoogieDeclarations]: Found implementation of procedure free_data [2018-02-04 13:28:06,014 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 13:28:06,014 INFO L128 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-02-04 13:28:06,014 INFO L128 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-02-04 13:28:06,015 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 13:28:06,015 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 13:28:06,015 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 13:28:06,015 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 13:28:06,015 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 13:28:06,015 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 13:28:06,015 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 13:28:06,015 INFO L128 BoogieDeclarations]: Found specification of procedure alloc_data [2018-02-04 13:28:06,015 INFO L128 BoogieDeclarations]: Found specification of procedure free_data [2018-02-04 13:28:06,015 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 13:28:06,015 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 13:28:06,015 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 13:28:06,211 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 13:28:06,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:28:06 BoogieIcfgContainer [2018-02-04 13:28:06,211 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 13:28:06,212 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 13:28:06,212 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 13:28:06,214 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 13:28:06,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:28:05" (1/3) ... [2018-02-04 13:28:06,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4552ec67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:28:06, skipping insertion in model container [2018-02-04 13:28:06,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:28:05" (2/3) ... [2018-02-04 13:28:06,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4552ec67 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:28:06, skipping insertion in model container [2018-02-04 13:28:06,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:28:06" (3/3) ... [2018-02-04 13:28:06,217 INFO L107 eAbstractionObserver]: Analyzing ICFG test-0019_1_true-valid-memsafety_true-termination.i [2018-02-04 13:28:06,222 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 13:28:06,227 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 25 error locations. [2018-02-04 13:28:06,253 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 13:28:06,253 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 13:28:06,253 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 13:28:06,253 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 13:28:06,253 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 13:28:06,253 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 13:28:06,253 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 13:28:06,253 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 13:28:06,254 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 13:28:06,261 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states. [2018-02-04 13:28:06,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 13:28:06,267 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:06,267 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:06,267 INFO L371 AbstractCegarLoop]: === Iteration 1 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 13:28:06,270 INFO L82 PathProgramCache]: Analyzing trace with hash -2011258117, now seen corresponding path program 1 times [2018-02-04 13:28:06,271 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:06,271 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:06,305 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:06,305 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:06,305 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:06,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:06,343 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:06,459 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:06,461 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:06,461 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:28:06,463 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:28:06,475 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:28:06,475 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:28:06,477 INFO L87 Difference]: Start difference. First operand 63 states. Second operand 5 states. [2018-02-04 13:28:06,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:06,620 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-02-04 13:28:06,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:28:06,621 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2018-02-04 13:28:06,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:06,633 INFO L225 Difference]: With dead ends: 57 [2018-02-04 13:28:06,633 INFO L226 Difference]: Without dead ends: 54 [2018-02-04 13:28:06,635 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:28:06,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-02-04 13:28:06,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-02-04 13:28:06,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-02-04 13:28:06,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-02-04 13:28:06,663 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 10 [2018-02-04 13:28:06,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:06,663 INFO L432 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-02-04 13:28:06,663 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:28:06,663 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-02-04 13:28:06,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-02-04 13:28:06,663 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:06,663 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:06,663 INFO L371 AbstractCegarLoop]: === Iteration 2 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 13:28:06,664 INFO L82 PathProgramCache]: Analyzing trace with hash -2011258116, now seen corresponding path program 1 times [2018-02-04 13:28:06,664 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:06,664 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:06,665 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:06,665 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:06,665 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:06,680 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:06,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:06,765 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:06,766 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:28:06,767 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:28:06,767 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:28:06,768 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:28:06,768 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 6 states. [2018-02-04 13:28:06,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:06,885 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-02-04 13:28:06,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:28:06,886 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-02-04 13:28:06,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:06,886 INFO L225 Difference]: With dead ends: 48 [2018-02-04 13:28:06,886 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 13:28:06,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:28:06,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 13:28:06,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 13:28:06,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 13:28:06,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-02-04 13:28:06,890 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 10 [2018-02-04 13:28:06,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:06,890 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-02-04 13:28:06,890 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:28:06,890 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-02-04 13:28:06,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:28:06,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:06,890 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:06,890 INFO L371 AbstractCegarLoop]: === Iteration 3 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 13:28:06,891 INFO L82 PathProgramCache]: Analyzing trace with hash 1103295359, now seen corresponding path program 1 times [2018-02-04 13:28:06,891 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:06,891 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:06,892 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:06,892 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:06,892 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:06,909 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:06,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:06,962 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:06,962 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:28:06,962 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:28:06,962 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:28:06,963 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:28:06,963 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 5 states. [2018-02-04 13:28:07,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:07,022 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-02-04 13:28:07,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:28:07,023 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 13:28:07,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:07,023 INFO L225 Difference]: With dead ends: 47 [2018-02-04 13:28:07,023 INFO L226 Difference]: Without dead ends: 47 [2018-02-04 13:28:07,023 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:28:07,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-02-04 13:28:07,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-02-04 13:28:07,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-02-04 13:28:07,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-02-04 13:28:07,026 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 14 [2018-02-04 13:28:07,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:07,026 INFO L432 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-02-04 13:28:07,026 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:28:07,026 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-02-04 13:28:07,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:28:07,026 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:07,027 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:07,027 INFO L371 AbstractCegarLoop]: === Iteration 4 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 13:28:07,027 INFO L82 PathProgramCache]: Analyzing trace with hash 1103295360, now seen corresponding path program 1 times [2018-02-04 13:28:07,027 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:07,027 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:07,028 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:07,028 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:07,028 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:07,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:07,041 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:07,131 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:07,131 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:07,131 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:28:07,131 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:28:07,132 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:28:07,132 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:28:07,132 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 6 states. [2018-02-04 13:28:07,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:07,221 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-02-04 13:28:07,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:28:07,222 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2018-02-04 13:28:07,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:07,222 INFO L225 Difference]: With dead ends: 46 [2018-02-04 13:28:07,222 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 13:28:07,223 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:28:07,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 13:28:07,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2018-02-04 13:28:07,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-02-04 13:28:07,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-02-04 13:28:07,225 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 14 [2018-02-04 13:28:07,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:07,226 INFO L432 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-02-04 13:28:07,226 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:28:07,226 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-02-04 13:28:07,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 13:28:07,226 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:07,227 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:07,227 INFO L371 AbstractCegarLoop]: === Iteration 5 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 13:28:07,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1112691179, now seen corresponding path program 1 times [2018-02-04 13:28:07,227 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:07,227 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:07,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:07,228 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:07,228 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:07,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:07,241 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:07,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:07,348 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:07,348 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 13:28:07,348 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 13:28:07,348 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 13:28:07,348 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 13:28:07,348 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 12 states. [2018-02-04 13:28:07,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:07,576 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-02-04 13:28:07,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 13:28:07,576 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-02-04 13:28:07,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:07,576 INFO L225 Difference]: With dead ends: 45 [2018-02-04 13:28:07,577 INFO L226 Difference]: Without dead ends: 45 [2018-02-04 13:28:07,577 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-02-04 13:28:07,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-02-04 13:28:07,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-02-04 13:28:07,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-02-04 13:28:07,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-02-04 13:28:07,579 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 17 [2018-02-04 13:28:07,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:07,579 INFO L432 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-02-04 13:28:07,579 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 13:28:07,580 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-02-04 13:28:07,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-02-04 13:28:07,580 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:07,580 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:07,580 INFO L371 AbstractCegarLoop]: === Iteration 6 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 13:28:07,580 INFO L82 PathProgramCache]: Analyzing trace with hash -1112691178, now seen corresponding path program 1 times [2018-02-04 13:28:07,580 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:07,580 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:07,581 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:07,581 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:07,581 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:07,595 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:07,717 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:07,717 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-02-04 13:28:07,718 INFO L409 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-02-04 13:28:07,718 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-02-04 13:28:07,718 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-02-04 13:28:07,718 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 12 states. [2018-02-04 13:28:07,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:07,897 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-02-04 13:28:07,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-02-04 13:28:07,897 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-02-04 13:28:07,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:07,898 INFO L225 Difference]: With dead ends: 44 [2018-02-04 13:28:07,898 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 13:28:07,898 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=275, Unknown=0, NotChecked=0, Total=380 [2018-02-04 13:28:07,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 13:28:07,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2018-02-04 13:28:07,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-02-04 13:28:07,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-02-04 13:28:07,901 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 17 [2018-02-04 13:28:07,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:07,902 INFO L432 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-02-04 13:28:07,902 INFO L433 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-02-04 13:28:07,902 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-02-04 13:28:07,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 13:28:07,902 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:07,903 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] [2018-02-04 13:28:07,903 INFO L371 AbstractCegarLoop]: === Iteration 7 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 13:28:07,903 INFO L82 PathProgramCache]: Analyzing trace with hash -221609387, now seen corresponding path program 1 times [2018-02-04 13:28:07,903 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:07,903 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:07,904 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:07,904 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:07,904 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:07,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:07,920 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:08,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-04 13:28:08,104 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:08,104 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-04 13:28:08,104 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 13:28:08,104 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 13:28:08,105 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:28:08,105 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 17 states. [2018-02-04 13:28:08,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:08,491 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-02-04 13:28:08,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-02-04 13:28:08,491 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-02-04 13:28:08,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:08,492 INFO L225 Difference]: With dead ends: 46 [2018-02-04 13:28:08,492 INFO L226 Difference]: Without dead ends: 46 [2018-02-04 13:28:08,492 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=655, Unknown=0, NotChecked=0, Total=756 [2018-02-04 13:28:08,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-02-04 13:28:08,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 42. [2018-02-04 13:28:08,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-02-04 13:28:08,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-02-04 13:28:08,495 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 25 [2018-02-04 13:28:08,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:08,495 INFO L432 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-02-04 13:28:08,495 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 13:28:08,495 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-02-04 13:28:08,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-02-04 13:28:08,496 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:08,496 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] [2018-02-04 13:28:08,496 INFO L371 AbstractCegarLoop]: === Iteration 8 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 13:28:08,496 INFO L82 PathProgramCache]: Analyzing trace with hash -221609386, now seen corresponding path program 1 times [2018-02-04 13:28:08,496 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:08,497 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:08,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:08,497 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:08,497 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:08,513 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:08,727 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:08,727 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:08,727 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-04 13:28:08,727 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 13:28:08,727 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 13:28:08,728 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=238, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:28:08,728 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 17 states. [2018-02-04 13:28:09,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:09,135 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-02-04 13:28:09,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 13:28:09,135 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 25 [2018-02-04 13:28:09,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:09,135 INFO L225 Difference]: With dead ends: 44 [2018-02-04 13:28:09,135 INFO L226 Difference]: Without dead ends: 44 [2018-02-04 13:28:09,136 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 97 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=111, Invalid=759, Unknown=0, NotChecked=0, Total=870 [2018-02-04 13:28:09,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-02-04 13:28:09,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 40. [2018-02-04 13:28:09,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-02-04 13:28:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-02-04 13:28:09,137 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 25 [2018-02-04 13:28:09,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:09,138 INFO L432 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-02-04 13:28:09,138 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 13:28:09,138 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-02-04 13:28:09,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 13:28:09,138 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:09,138 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] [2018-02-04 13:28:09,138 INFO L371 AbstractCegarLoop]: === Iteration 9 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 13:28:09,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1720043612, now seen corresponding path program 1 times [2018-02-04 13:28:09,139 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:09,139 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:09,139 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:09,139 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:09,139 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:09,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:09,148 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:09,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:09,427 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:09,427 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-04 13:28:09,427 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 13:28:09,428 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 13:28:09,428 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=239, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:28:09,428 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 17 states. [2018-02-04 13:28:09,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:09,919 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-02-04 13:28:09,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-02-04 13:28:09,920 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-02-04 13:28:09,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:09,920 INFO L225 Difference]: With dead ends: 43 [2018-02-04 13:28:09,920 INFO L226 Difference]: Without dead ends: 43 [2018-02-04 13:28:09,921 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=116, Invalid=814, Unknown=0, NotChecked=0, Total=930 [2018-02-04 13:28:09,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-02-04 13:28:09,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 39. [2018-02-04 13:28:09,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-02-04 13:28:09,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-02-04 13:28:09,923 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 26 [2018-02-04 13:28:09,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:09,923 INFO L432 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-02-04 13:28:09,923 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 13:28:09,923 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-02-04 13:28:09,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-02-04 13:28:09,924 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:09,924 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] [2018-02-04 13:28:09,924 INFO L371 AbstractCegarLoop]: === Iteration 10 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 13:28:09,924 INFO L82 PathProgramCache]: Analyzing trace with hash 1720043613, now seen corresponding path program 1 times [2018-02-04 13:28:09,925 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:09,925 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:09,925 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:09,925 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:09,926 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:09,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:09,940 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:10,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-04 13:28:10,286 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:10,312 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-02-04 13:28:10,312 INFO L409 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-02-04 13:28:10,312 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-02-04 13:28:10,312 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=235, Unknown=0, NotChecked=0, Total=272 [2018-02-04 13:28:10,312 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2018-02-04 13:28:10,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:10,885 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-02-04 13:28:10,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-02-04 13:28:10,886 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 26 [2018-02-04 13:28:10,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:10,886 INFO L225 Difference]: With dead ends: 41 [2018-02-04 13:28:10,886 INFO L226 Difference]: Without dead ends: 41 [2018-02-04 13:28:10,887 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=141, Invalid=915, Unknown=0, NotChecked=0, Total=1056 [2018-02-04 13:28:10,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-02-04 13:28:10,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 37. [2018-02-04 13:28:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-02-04 13:28:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-02-04 13:28:10,889 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 26 [2018-02-04 13:28:10,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:10,889 INFO L432 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-02-04 13:28:10,889 INFO L433 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-02-04 13:28:10,890 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-02-04 13:28:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 13:28:10,890 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:10,890 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:10,890 INFO L371 AbstractCegarLoop]: === Iteration 11 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 13:28:10,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1435540609, now seen corresponding path program 1 times [2018-02-04 13:28:10,891 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:10,891 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:10,891 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:10,891 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:10,892 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:10,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:10,906 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:11,267 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:11,267 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:11,267 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-02-04 13:28:11,268 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 13:28:11,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 13:28:11,268 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=333, Unknown=0, NotChecked=0, Total=380 [2018-02-04 13:28:11,268 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 20 states. [2018-02-04 13:28:11,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:11,738 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-02-04 13:28:11,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-02-04 13:28:11,738 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 29 [2018-02-04 13:28:11,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:11,739 INFO L225 Difference]: With dead ends: 40 [2018-02-04 13:28:11,739 INFO L226 Difference]: Without dead ends: 40 [2018-02-04 13:28:11,739 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 185 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=1102, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 13:28:11,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-02-04 13:28:11,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2018-02-04 13:28:11,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 13:28:11,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-02-04 13:28:11,741 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 29 [2018-02-04 13:28:11,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:11,741 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-02-04 13:28:11,741 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 13:28:11,741 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-02-04 13:28:11,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2018-02-04 13:28:11,741 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:11,742 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:11,742 INFO L371 AbstractCegarLoop]: === Iteration 12 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 13:28:11,742 INFO L82 PathProgramCache]: Analyzing trace with hash 716201536, now seen corresponding path program 1 times [2018-02-04 13:28:11,742 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:11,742 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:11,742 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:11,742 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:11,742 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:11,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:11,751 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:12,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:12,390 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:12,390 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2018-02-04 13:28:12,390 INFO L409 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-02-04 13:28:12,390 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-02-04 13:28:12,390 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2018-02-04 13:28:12,390 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 20 states. [2018-02-04 13:28:13,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:13,409 INFO L93 Difference]: Finished difference Result 38 states and 37 transitions. [2018-02-04 13:28:13,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-02-04 13:28:13,409 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 33 [2018-02-04 13:28:13,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:13,409 INFO L225 Difference]: With dead ends: 38 [2018-02-04 13:28:13,409 INFO L226 Difference]: Without dead ends: 36 [2018-02-04 13:28:13,410 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=139, Invalid=1121, Unknown=0, NotChecked=0, Total=1260 [2018-02-04 13:28:13,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-02-04 13:28:13,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2018-02-04 13:28:13,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-02-04 13:28:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 35 transitions. [2018-02-04 13:28:13,411 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 35 transitions. Word has length 33 [2018-02-04 13:28:13,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:13,411 INFO L432 AbstractCegarLoop]: Abstraction has 36 states and 35 transitions. [2018-02-04 13:28:13,411 INFO L433 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-02-04 13:28:13,411 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 35 transitions. [2018-02-04 13:28:13,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-02-04 13:28:13,412 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:28:13,412 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:28:13,412 INFO L371 AbstractCegarLoop]: === Iteration 13 === [alloc_dataErr4RequiresViolation, alloc_dataErr10RequiresViolation, alloc_dataErr2RequiresViolation, alloc_dataErr8RequiresViolation, alloc_dataErr0RequiresViolation, alloc_dataErr1RequiresViolation, alloc_dataErr6RequiresViolation, alloc_dataErr7RequiresViolation, alloc_dataErr3RequiresViolation, alloc_dataErr11RequiresViolation, alloc_dataErr5RequiresViolation, alloc_dataErr9RequiresViolation, mainErr3RequiresViolation, mainErr1RequiresViolation, mainErr2RequiresViolation, mainErr0RequiresViolation, mainErr4EnsuresViolation, free_dataErr3RequiresViolation, free_dataErr1RequiresViolation, free_dataErr7RequiresViolation, free_dataErr2RequiresViolation, free_dataErr4RequiresViolation, free_dataErr6RequiresViolation, free_dataErr0RequiresViolation, free_dataErr5RequiresViolation]=== [2018-02-04 13:28:13,412 INFO L82 PathProgramCache]: Analyzing trace with hash 578567044, now seen corresponding path program 1 times [2018-02-04 13:28:13,412 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:28:13,412 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:28:13,413 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:13,413 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:28:13,413 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:28:13,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:28:13,429 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:28:14,265 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:28:14,266 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:28:14,266 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-02-04 13:28:14,266 INFO L409 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-02-04 13:28:14,266 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-02-04 13:28:14,267 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2018-02-04 13:28:14,267 INFO L87 Difference]: Start difference. First operand 36 states and 35 transitions. Second operand 24 states. [2018-02-04 13:28:15,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:28:15,429 INFO L93 Difference]: Finished difference Result 35 states and 34 transitions. [2018-02-04 13:28:15,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-02-04 13:28:15,429 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 35 [2018-02-04 13:28:15,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:28:15,429 INFO L225 Difference]: With dead ends: 35 [2018-02-04 13:28:15,429 INFO L226 Difference]: Without dead ends: 0 [2018-02-04 13:28:15,430 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=184, Invalid=1538, Unknown=0, NotChecked=0, Total=1722 [2018-02-04 13:28:15,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-02-04 13:28:15,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-02-04 13:28:15,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-02-04 13:28:15,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-02-04 13:28:15,430 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 35 [2018-02-04 13:28:15,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:28:15,431 INFO L432 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-02-04 13:28:15,431 INFO L433 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-02-04 13:28:15,431 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-02-04 13:28:15,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-02-04 13:28:15,435 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:28:15 BoogieIcfgContainer [2018-02-04 13:28:15,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 13:28:15,436 INFO L168 Benchmark]: Toolchain (without parser) took 9624.83 ms. Allocated memory was 388.5 MB in the beginning and 767.6 MB in the end (delta: 379.1 MB). Free memory was 345.4 MB in the beginning and 710.8 MB in the end (delta: -365.4 MB). Peak memory consumption was 13.6 MB. Max. memory is 5.3 GB. [2018-02-04 13:28:15,437 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 388.5 MB. Free memory is still 352.0 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 13:28:15,437 INFO L168 Benchmark]: CACSL2BoogieTranslator took 146.65 ms. Allocated memory is still 388.5 MB. Free memory was 345.4 MB in the beginning and 334.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. [2018-02-04 13:28:15,437 INFO L168 Benchmark]: Boogie Preprocessor took 21.03 ms. Allocated memory is still 388.5 MB. Free memory was 334.8 MB in the beginning and 333.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. [2018-02-04 13:28:15,437 INFO L168 Benchmark]: RCFGBuilder took 230.57 ms. Allocated memory is still 388.5 MB. Free memory was 333.5 MB in the beginning and 311.5 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. [2018-02-04 13:28:15,437 INFO L168 Benchmark]: TraceAbstraction took 9223.50 ms. Allocated memory was 388.5 MB in the beginning and 767.6 MB in the end (delta: 379.1 MB). Free memory was 311.5 MB in the beginning and 710.8 MB in the end (delta: -399.3 MB). There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 13:28:15,438 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.13 ms. Allocated memory is still 388.5 MB. Free memory is still 352.0 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 146.65 ms. Allocated memory is still 388.5 MB. Free memory was 345.4 MB in the beginning and 334.8 MB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 21.03 ms. Allocated memory is still 388.5 MB. Free memory was 334.8 MB in the beginning and 333.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 230.57 ms. Allocated memory is still 388.5 MB. Free memory was 333.5 MB in the beginning and 311.5 MB in the end (delta: 22.0 MB). Peak memory consumption was 22.0 MB. Max. memory is 5.3 GB. * TraceAbstraction took 9223.50 ms. Allocated memory was 388.5 MB in the beginning and 767.6 MB in the end (delta: 379.1 MB). Free memory was 311.5 MB in the beginning and 710.8 MB in the end (delta: -399.3 MB). There was no memory consumed. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 639]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 1]: free always succeeds For all program executions holds that free always succeeds at this location - AllSpecificationsHoldResult: All specifications hold 25 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 63 locations, 25 error locations. SAFE Result, 9.1s OverallTime, 13 OverallIterations, 1 TraceHistogramMax, 5.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 329 SDtfs, 445 SDslu, 1736 SDs, 0 SdLazy, 3126 SolverSat, 242 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 300 GetRequests, 16 SyntacticMatches, 4 SemanticMatches, 280 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1028 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 13 MinimizatonAttempts, 20 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 281 NumberOfCodeBlocks, 281 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 268 ConstructedInterpolants, 0 QuantifiedInterpolants, 131707 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_13-28-15-444.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/test-0019_1_true-valid-memsafety_true-termination.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_13-28-15-444.csv Received shutdown request...