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/960521-1_1_false-valid-deref.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c17473d-m [2018-02-04 13:20:22,737 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-02-04 13:20:22,739 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-02-04 13:20:22,751 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-02-04 13:20:22,751 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-02-04 13:20:22,752 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-02-04 13:20:22,753 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-02-04 13:20:22,756 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-02-04 13:20:22,758 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-02-04 13:20:22,760 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-02-04 13:20:22,761 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-02-04 13:20:22,761 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-02-04 13:20:22,762 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-02-04 13:20:22,764 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-02-04 13:20:22,765 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-02-04 13:20:22,767 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-02-04 13:20:22,768 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-02-04 13:20:22,770 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-02-04 13:20:22,771 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-02-04 13:20:22,772 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-02-04 13:20:22,774 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-02-04 13:20:22,774 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-02-04 13:20:22,774 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-02-04 13:20:22,775 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-02-04 13:20:22,776 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-02-04 13:20:22,777 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-02-04 13:20:22,777 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-02-04 13:20:22,777 INFO L177 SettingsManager]: PEA to Boogie provides no preferences, ignoring... [2018-02-04 13:20:22,778 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-02-04 13:20:22,778 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-02-04 13:20:22,778 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-02-04 13:20:22,778 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:20:22,787 INFO L110 SettingsManager]: Loading preferences was successful [2018-02-04 13:20:22,787 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-02-04 13:20:22,788 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-02-04 13:20:22,788 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-02-04 13:20:22,788 INFO L133 SettingsManager]: * Use SBE=true [2018-02-04 13:20:22,788 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-02-04 13:20:22,788 INFO L133 SettingsManager]: * sizeof long=4 [2018-02-04 13:20:22,788 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-02-04 13:20:22,788 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-02-04 13:20:22,789 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-02-04 13:20:22,789 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-02-04 13:20:22,789 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-02-04 13:20:22,789 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-02-04 13:20:22,789 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-02-04 13:20:22,789 INFO L133 SettingsManager]: * sizeof long double=12 [2018-02-04 13:20:22,789 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-02-04 13:20:22,789 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-02-04 13:20:22,789 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-02-04 13:20:22,789 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-02-04 13:20:22,790 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-02-04 13:20:22,790 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-02-04 13:20:22,790 INFO L133 SettingsManager]: * Interpolant automaton=TWOTRACK [2018-02-04 13:20:22,790 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-02-04 13:20:22,790 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-02-04 13:20:22,819 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-02-04 13:20:22,828 INFO L266 ainManager$Toolchain]: [Toolchain 1]: Parser(s) successfully initialized [2018-02-04 13:20:22,830 INFO L222 ainManager$Toolchain]: [Toolchain 1]: Toolchain data selected. [2018-02-04 13:20:22,831 INFO L271 PluginConnector]: Initializing CDTParser... [2018-02-04 13:20:22,832 INFO L276 PluginConnector]: CDTParser initialized [2018-02-04 13:20:22,832 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext-properties/960521-1_1_false-valid-deref.i [2018-02-04 13:20:22,963 INFO L304 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-02-04 13:20:22,963 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-02-04 13:20:22,964 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-02-04 13:20:22,964 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-02-04 13:20:22,968 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-02-04 13:20:22,970 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:20:22" (1/1) ... [2018-02-04 13:20:22,972 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7495b65f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:20:22, skipping insertion in model container [2018-02-04 13:20:22,972 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.02 01:20:22" (1/1) ... [2018-02-04 13:20:22,982 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:20:23,008 INFO L153 Dispatcher]: Using SV-COMP mode [2018-02-04 13:20:23,103 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:20:23,116 INFO L450 PostProcessor]: Settings: Checked method=main [2018-02-04 13:20:23,123 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:20:23 WrapperNode [2018-02-04 13:20:23,123 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-02-04 13:20:23,124 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-02-04 13:20:23,124 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-02-04 13:20:23,125 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-02-04 13:20:23,134 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:20:23" (1/1) ... [2018-02-04 13:20:23,134 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:20:23" (1/1) ... [2018-02-04 13:20:23,141 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:20:23" (1/1) ... [2018-02-04 13:20:23,141 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:20:23" (1/1) ... [2018-02-04 13:20:23,143 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:20:23" (1/1) ... [2018-02-04 13:20:23,146 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:20:23" (1/1) ... [2018-02-04 13:20:23,147 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:20:23" (1/1) ... [2018-02-04 13:20:23,150 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-02-04 13:20:23,150 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-02-04 13:20:23,151 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-02-04 13:20:23,151 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-02-04 13:20:23,153 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:20:23" (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:20:23,192 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-02-04 13:20:23,193 INFO L136 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-02-04 13:20:23,193 INFO L136 BoogieDeclarations]: Found implementation of procedure foo [2018-02-04 13:20:23,193 INFO L136 BoogieDeclarations]: Found implementation of procedure main [2018-02-04 13:20:23,193 INFO L128 BoogieDeclarations]: Found specification of procedure write~int [2018-02-04 13:20:23,193 INFO L128 BoogieDeclarations]: Found specification of procedure read~int [2018-02-04 13:20:23,193 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.free [2018-02-04 13:20:23,193 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-02-04 13:20:23,193 INFO L128 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-02-04 13:20:23,193 INFO L128 BoogieDeclarations]: Found specification of procedure malloc [2018-02-04 13:20:23,193 INFO L128 BoogieDeclarations]: Found specification of procedure free [2018-02-04 13:20:23,193 INFO L128 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2018-02-04 13:20:23,194 INFO L128 BoogieDeclarations]: Found specification of procedure foo [2018-02-04 13:20:23,194 INFO L128 BoogieDeclarations]: Found specification of procedure main [2018-02-04 13:20:23,194 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-02-04 13:20:23,194 INFO L128 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-02-04 13:20:23,347 INFO L257 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-02-04 13:20:23,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:20:23 BoogieIcfgContainer [2018-02-04 13:20:23,348 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-02-04 13:20:23,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-02-04 13:20:23,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-02-04 13:20:23,350 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-02-04 13:20:23,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.02 01:20:22" (1/3) ... [2018-02-04 13:20:23,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1056bf42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:20:23, skipping insertion in model container [2018-02-04 13:20:23,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.02 01:20:23" (2/3) ... [2018-02-04 13:20:23,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1056bf42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.02 01:20:23, skipping insertion in model container [2018-02-04 13:20:23,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.02 01:20:23" (3/3) ... [2018-02-04 13:20:23,352 INFO L107 eAbstractionObserver]: Analyzing ICFG 960521-1_1_false-valid-deref.i [2018-02-04 13:20:23,358 INFO L128 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-02-04 13:20:23,363 INFO L140 ceAbstractionStarter]: Appying trace abstraction to program that has 17 error locations. [2018-02-04 13:20:23,405 INFO L322 AbstractCegarLoop]: Interprodecural is true [2018-02-04 13:20:23,405 INFO L323 AbstractCegarLoop]: Hoare is false [2018-02-04 13:20:23,405 INFO L324 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-02-04 13:20:23,405 INFO L325 AbstractCegarLoop]: Backedges is TWOTRACK [2018-02-04 13:20:23,405 INFO L326 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-02-04 13:20:23,405 INFO L327 AbstractCegarLoop]: Difference is false [2018-02-04 13:20:23,406 INFO L328 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-02-04 13:20:23,406 INFO L333 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-02-04 13:20:23,406 INFO L87 2NestedWordAutomaton]: Mode: main mode - execution starts in main procedure [2018-02-04 13:20:23,415 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states. [2018-02-04 13:20:23,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-02-04 13:20:23,422 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:20:23,423 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:20:23,423 INFO L371 AbstractCegarLoop]: === Iteration 1 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 13:20:23,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1352732268, now seen corresponding path program 1 times [2018-02-04 13:20:23,427 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:20:23,428 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:20:23,457 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:20:23,458 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:20:23,458 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:20:23,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:20:23,496 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:20:23,526 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:20:23,528 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:20:23,529 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-02-04 13:20:23,530 INFO L409 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-02-04 13:20:23,538 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-02-04 13:20:23,539 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-02-04 13:20:23,540 INFO L87 Difference]: Start difference. First operand 56 states. Second operand 2 states. [2018-02-04 13:20:23,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:20:23,553 INFO L93 Difference]: Finished difference Result 56 states and 59 transitions. [2018-02-04 13:20:23,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-02-04 13:20:23,554 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-02-04 13:20:23,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:20:23,560 INFO L225 Difference]: With dead ends: 56 [2018-02-04 13:20:23,560 INFO L226 Difference]: Without dead ends: 53 [2018-02-04 13:20:23,561 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-04 13:20:23,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-02-04 13:20:23,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-02-04 13:20:23,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-02-04 13:20:23,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 56 transitions. [2018-02-04 13:20:23,671 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 56 transitions. Word has length 12 [2018-02-04 13:20:23,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:20:23,671 INFO L432 AbstractCegarLoop]: Abstraction has 53 states and 56 transitions. [2018-02-04 13:20:23,671 INFO L433 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-02-04 13:20:23,671 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 56 transitions. [2018-02-04 13:20:23,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:20:23,672 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:20:23,672 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:20:23,672 INFO L371 AbstractCegarLoop]: === Iteration 2 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 13:20:23,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920166, now seen corresponding path program 1 times [2018-02-04 13:20:23,672 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:20:23,672 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:20:23,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:20:23,673 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:20:23,673 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:20:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:20:23,697 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:20:23,742 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:20:23,742 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:20:23,742 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:20:23,743 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:20:23,744 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:20:23,744 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:20:23,744 INFO L87 Difference]: Start difference. First operand 53 states and 56 transitions. Second operand 4 states. [2018-02-04 13:20:23,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:20:23,835 INFO L93 Difference]: Finished difference Result 52 states and 55 transitions. [2018-02-04 13:20:23,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-02-04 13:20:23,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-02-04 13:20:23,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:20:23,839 INFO L225 Difference]: With dead ends: 52 [2018-02-04 13:20:23,839 INFO L226 Difference]: Without dead ends: 52 [2018-02-04 13:20:23,840 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:20:23,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-02-04 13:20:23,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2018-02-04 13:20:23,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-02-04 13:20:23,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 55 transitions. [2018-02-04 13:20:23,845 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 55 transitions. Word has length 14 [2018-02-04 13:20:23,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:20:23,845 INFO L432 AbstractCegarLoop]: Abstraction has 52 states and 55 transitions. [2018-02-04 13:20:23,845 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:20:23,845 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 55 transitions. [2018-02-04 13:20:23,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-02-04 13:20:23,846 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:20:23,846 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:20:23,846 INFO L371 AbstractCegarLoop]: === Iteration 3 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 13:20:23,847 INFO L82 PathProgramCache]: Analyzing trace with hash -1000920165, now seen corresponding path program 1 times [2018-02-04 13:20:23,847 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:20:23,847 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:20:23,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:20:23,848 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:20:23,848 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:20:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:20:23,863 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:20:23,925 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:20:23,925 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:20:23,925 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-02-04 13:20:23,925 INFO L409 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-02-04 13:20:23,925 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-02-04 13:20:23,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:20:23,926 INFO L87 Difference]: Start difference. First operand 52 states and 55 transitions. Second operand 5 states. [2018-02-04 13:20:23,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:20:23,989 INFO L93 Difference]: Finished difference Result 51 states and 54 transitions. [2018-02-04 13:20:23,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:20:23,989 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-02-04 13:20:23,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:20:23,990 INFO L225 Difference]: With dead ends: 51 [2018-02-04 13:20:23,990 INFO L226 Difference]: Without dead ends: 51 [2018-02-04 13:20:23,991 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-04 13:20:23,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-02-04 13:20:23,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-02-04 13:20:23,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-02-04 13:20:23,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 54 transitions. [2018-02-04 13:20:23,995 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 54 transitions. Word has length 14 [2018-02-04 13:20:23,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:20:23,996 INFO L432 AbstractCegarLoop]: Abstraction has 51 states and 54 transitions. [2018-02-04 13:20:23,996 INFO L433 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-02-04 13:20:23,996 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 54 transitions. [2018-02-04 13:20:23,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 13:20:23,996 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:20:23,997 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:20:23,997 INFO L371 AbstractCegarLoop]: === Iteration 4 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 13:20:23,997 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748963, now seen corresponding path program 1 times [2018-02-04 13:20:23,997 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:20:23,997 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:20:23,998 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:20:23,998 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:20:23,998 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:20:24,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:20:24,017 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:20:24,069 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:20:24,069 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:20:24,070 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-02-04 13:20:24,070 INFO L409 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-02-04 13:20:24,070 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-02-04 13:20:24,070 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-02-04 13:20:24,070 INFO L87 Difference]: Start difference. First operand 51 states and 54 transitions. Second operand 6 states. [2018-02-04 13:20:24,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:20:24,128 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2018-02-04 13:20:24,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:20:24,128 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-02-04 13:20:24,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:20:24,129 INFO L225 Difference]: With dead ends: 48 [2018-02-04 13:20:24,129 INFO L226 Difference]: Without dead ends: 48 [2018-02-04 13:20:24,130 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-04 13:20:24,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-02-04 13:20:24,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2018-02-04 13:20:24,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-02-04 13:20:24,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 51 transitions. [2018-02-04 13:20:24,134 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 51 transitions. Word has length 20 [2018-02-04 13:20:24,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:20:24,134 INFO L432 AbstractCegarLoop]: Abstraction has 48 states and 51 transitions. [2018-02-04 13:20:24,135 INFO L433 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-02-04 13:20:24,135 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 51 transitions. [2018-02-04 13:20:24,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-02-04 13:20:24,135 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:20:24,135 INFO L351 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:20:24,135 INFO L371 AbstractCegarLoop]: === Iteration 5 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 13:20:24,136 INFO L82 PathProgramCache]: Analyzing trace with hash -1559748962, now seen corresponding path program 1 times [2018-02-04 13:20:24,136 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:20:24,136 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:20:24,137 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:20:24,137 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:20:24,137 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:20:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:20:24,150 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:20:24,255 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:20:24,255 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:20:24,256 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-02-04 13:20:24,256 INFO L409 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-02-04 13:20:24,256 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-02-04 13:20:24,256 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2018-02-04 13:20:24,256 INFO L87 Difference]: Start difference. First operand 48 states and 51 transitions. Second operand 7 states. [2018-02-04 13:20:24,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:20:24,349 INFO L93 Difference]: Finished difference Result 58 states and 62 transitions. [2018-02-04 13:20:24,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-02-04 13:20:24,350 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-02-04 13:20:24,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:20:24,353 INFO L225 Difference]: With dead ends: 58 [2018-02-04 13:20:24,353 INFO L226 Difference]: Without dead ends: 58 [2018-02-04 13:20:24,353 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2018-02-04 13:20:24,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-02-04 13:20:24,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-02-04 13:20:24,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-02-04 13:20:24,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 52 transitions. [2018-02-04 13:20:24,358 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 52 transitions. Word has length 20 [2018-02-04 13:20:24,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:20:24,358 INFO L432 AbstractCegarLoop]: Abstraction has 49 states and 52 transitions. [2018-02-04 13:20:24,358 INFO L433 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-02-04 13:20:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 52 transitions. [2018-02-04 13:20:24,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-02-04 13:20:24,359 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:20:24,359 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] [2018-02-04 13:20:24,359 INFO L371 AbstractCegarLoop]: === Iteration 6 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 13:20:24,359 INFO L82 PathProgramCache]: Analyzing trace with hash -1905865099, now seen corresponding path program 1 times [2018-02-04 13:20:24,360 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:20:24,360 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:20:24,360 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:20:24,361 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:20:24,361 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:20:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:20:24,371 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:20:24,440 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:20:24,440 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:20:24,440 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:20:24,449 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:20:24,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:20:24,479 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:20:24,510 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-04 13:20:24,527 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-02-04 13:20:24,527 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 9 [2018-02-04 13:20:24,527 INFO L409 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-02-04 13:20:24,528 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-02-04 13:20:24,528 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-02-04 13:20:24,528 INFO L87 Difference]: Start difference. First operand 49 states and 52 transitions. Second operand 9 states. [2018-02-04 13:20:24,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:20:24,621 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2018-02-04 13:20:24,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-02-04 13:20:24,622 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-02-04 13:20:24,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:20:24,623 INFO L225 Difference]: With dead ends: 86 [2018-02-04 13:20:24,623 INFO L226 Difference]: Without dead ends: 86 [2018-02-04 13:20:24,623 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2018-02-04 13:20:24,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-02-04 13:20:24,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 71. [2018-02-04 13:20:24,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-02-04 13:20:24,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2018-02-04 13:20:24,626 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 24 [2018-02-04 13:20:24,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:20:24,626 INFO L432 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2018-02-04 13:20:24,626 INFO L433 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-02-04 13:20:24,626 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2018-02-04 13:20:24,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-02-04 13:20:24,627 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:20:24,627 INFO L351 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:20:24,627 INFO L371 AbstractCegarLoop]: === Iteration 7 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 13:20:24,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1500155222, now seen corresponding path program 1 times [2018-02-04 13:20:24,628 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:20:24,628 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:20:24,628 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:20:24,629 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:20:24,629 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:20:24,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:20:24,641 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:20:24,765 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:20:24,765 INFO L308 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-02-04 13:20:24,766 INFO L213 onRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-02-04 13:20:24,772 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:20:24,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:20:24,804 INFO L270 TraceCheckSpWp]: Computing forward predicates... [2018-02-04 13:20:24,826 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-02-04 13:20:24,828 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:20:24,832 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-02-04 13:20:24,833 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-02-04 13:20:24,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2018-02-04 13:20:24,851 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-02-04 13:20:24,856 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-02-04 13:20:24,857 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:22, output treesize:21 [2018-02-04 13:20:24,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-02-04 13:20:24,979 INFO L320 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-02-04 13:20:24,979 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 12 [2018-02-04 13:20:24,979 INFO L409 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-02-04 13:20:24,980 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-02-04 13:20:24,980 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=113, Unknown=0, NotChecked=0, Total=156 [2018-02-04 13:20:24,980 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 13 states. [2018-02-04 13:20:25,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:20:25,289 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2018-02-04 13:20:25,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-02-04 13:20:25,289 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-02-04 13:20:25,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:20:25,290 INFO L225 Difference]: With dead ends: 105 [2018-02-04 13:20:25,290 INFO L226 Difference]: Without dead ends: 105 [2018-02-04 13:20:25,291 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 21 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2018-02-04 13:20:25,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-02-04 13:20:25,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 77. [2018-02-04 13:20:25,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-02-04 13:20:25,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2018-02-04 13:20:25,295 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 27 [2018-02-04 13:20:25,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:20:25,295 INFO L432 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2018-02-04 13:20:25,295 INFO L433 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-02-04 13:20:25,295 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2018-02-04 13:20:25,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 13:20:25,296 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:20:25,296 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:20:25,296 INFO L371 AbstractCegarLoop]: === Iteration 8 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 13:20:25,297 INFO L82 PathProgramCache]: Analyzing trace with hash 1897964650, now seen corresponding path program 1 times [2018-02-04 13:20:25,297 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:20:25,297 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:20:25,298 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:20:25,298 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:20:25,299 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:20:25,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-02-04 13:20:25,309 WARN L137 erpolLogProxyWrapper]: Using partial proofs (cut at CNF-level). Set option :produce-proofs to true to get complete proofs. [2018-02-04 13:20:25,339 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-02-04 13:20:25,340 INFO L320 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-02-04 13:20:25,340 INFO L335 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-02-04 13:20:25,340 INFO L409 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-02-04 13:20:25,340 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-02-04 13:20:25,340 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-02-04 13:20:25,340 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand 4 states. [2018-02-04 13:20:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-02-04 13:20:25,364 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2018-02-04 13:20:25,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-02-04 13:20:25,364 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 29 [2018-02-04 13:20:25,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-02-04 13:20:25,365 INFO L225 Difference]: With dead ends: 75 [2018-02-04 13:20:25,365 INFO L226 Difference]: Without dead ends: 75 [2018-02-04 13:20:25,365 INFO L554 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-02-04 13:20:25,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-02-04 13:20:25,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-02-04 13:20:25,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-02-04 13:20:25,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 79 transitions. [2018-02-04 13:20:25,369 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 79 transitions. Word has length 29 [2018-02-04 13:20:25,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-02-04 13:20:25,370 INFO L432 AbstractCegarLoop]: Abstraction has 75 states and 79 transitions. [2018-02-04 13:20:25,370 INFO L433 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-02-04 13:20:25,370 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2018-02-04 13:20:25,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-02-04 13:20:25,370 INFO L343 BasicCegarLoop]: Found error trace [2018-02-04 13:20:25,371 INFO L351 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-02-04 13:20:25,371 INFO L371 AbstractCegarLoop]: === Iteration 9 === [fooErr1RequiresViolation, fooErr0RequiresViolation, fooErr2RequiresViolation, fooErr3RequiresViolation, mainErr5RequiresViolation, mainErr1RequiresViolation, mainErr9RequiresViolation, mainErr0RequiresViolation, mainErr3RequiresViolation, mainErr7RequiresViolation, mainErr11RequiresViolation, mainErr8RequiresViolation, mainErr10RequiresViolation, mainErr2RequiresViolation, mainErr4RequiresViolation, mainErr6RequiresViolation, mainErr12EnsuresViolation]=== [2018-02-04 13:20:25,371 INFO L82 PathProgramCache]: Analyzing trace with hash 1897964651, now seen corresponding path program 1 times [2018-02-04 13:20:25,371 INFO L213 onRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-02-04 13:20:25,371 INFO L67 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-02-04 13:20:25,372 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:20:25,372 INFO L109 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-02-04 13:20:25,372 INFO L125 rtionOrderModulation]: Craig nested/tree interpolation forces the following order [2018-02-04 13:20:25,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 13:20:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-02-04 13:20:25,406 INFO L410 BasicCegarLoop]: Counterexample might be feasible [2018-02-04 13:20:25,434 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.02 01:20:25 BoogieIcfgContainer [2018-02-04 13:20:25,434 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-02-04 13:20:25,435 INFO L168 Benchmark]: Toolchain (without parser) took 2472.15 ms. Allocated memory was 399.5 MB in the beginning and 635.4 MB in the end (delta: 235.9 MB). Free memory was 356.2 MB in the beginning and 508.3 MB in the end (delta: -152.1 MB). Peak memory consumption was 83.9 MB. Max. memory is 5.3 GB. [2018-02-04 13:20:25,436 INFO L168 Benchmark]: CDTParser took 0.09 ms. Allocated memory is still 399.5 MB. Free memory is still 362.8 MB. There was no memory consumed. Max. memory is 5.3 GB. [2018-02-04 13:20:25,436 INFO L168 Benchmark]: CACSL2BoogieTranslator took 159.65 ms. Allocated memory is still 399.5 MB. Free memory was 356.2 MB in the beginning and 345.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. [2018-02-04 13:20:25,436 INFO L168 Benchmark]: Boogie Preprocessor took 25.75 ms. Allocated memory is still 399.5 MB. Free memory was 345.5 MB in the beginning and 344.2 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:20:25,437 INFO L168 Benchmark]: RCFGBuilder took 197.49 ms. Allocated memory is still 399.5 MB. Free memory was 344.2 MB in the beginning and 324.3 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. [2018-02-04 13:20:25,437 INFO L168 Benchmark]: TraceAbstraction took 2086.32 ms. Allocated memory was 399.5 MB in the beginning and 635.4 MB in the end (delta: 235.9 MB). Free memory was 324.3 MB in the beginning and 508.3 MB in the end (delta: -184.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 5.3 GB. [2018-02-04 13:20:25,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.09 ms. Allocated memory is still 399.5 MB. Free memory is still 362.8 MB. There was no memory consumed. Max. memory is 5.3 GB. * CACSL2BoogieTranslator took 159.65 ms. Allocated memory is still 399.5 MB. Free memory was 356.2 MB in the beginning and 345.5 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 5.3 GB. * Boogie Preprocessor took 25.75 ms. Allocated memory is still 399.5 MB. Free memory was 345.5 MB in the beginning and 344.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 5.3 GB. * RCFGBuilder took 197.49 ms. Allocated memory is still 399.5 MB. Free memory was 344.2 MB in the beginning and 324.3 MB in the end (delta: 19.9 MB). Peak memory consumption was 19.9 MB. Max. memory is 5.3 GB. * TraceAbstraction took 2086.32 ms. Allocated memory was 399.5 MB in the beginning and 635.4 MB in the end (delta: 235.9 MB). Free memory was 324.3 MB in the beginning and 508.3 MB in the end (delta: -184.0 MB). Peak memory consumption was 52.0 MB. Max. memory is 5.3 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L619] int *a, *b; [L620] int n; VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=0] [L632] n = 1 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, n=1] [L633] COND FALSE !(__VERIFIER_nondet_int() && n < 30) [L636] EXPR, FCALL malloc(n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={0:0}, b={0:0}, malloc(n * sizeof(*a))={7:0}, n=1] [L636] a = malloc(n * sizeof(*a)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc(n * sizeof(*a))={7:0}, n=1] [L637] EXPR, FCALL malloc(n * sizeof(*b)) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={0:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L637] b = malloc(n * sizeof(*b)) [L638] EXPR b++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L638] FCALL *b++ = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, b++={13:0}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L639] CALL foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, n=1] [L624] int i; [L625] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] COND TRUE i < n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L626] FCALL a[i] = n VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L625] i++ VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L625] COND FALSE !(i < n) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=1, n=1] [L627] i = 0 VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L627] COND FALSE, RET !(i < n - 1) VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, i=0, n=1] [L639] foo() VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] [L640] FCALL b[-2] VAL [\old(a)=0, \old(a)=0, \old(b)=0, \old(b)=0, \old(n)=0, a={7:0}, b={13:4}, malloc(n * sizeof(*a))={7:0}, malloc(n * sizeof(*b))={13:0}, n=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 56 locations, 17 error locations. UNSAFE Result, 2.0s OverallTime, 9 OverallIterations, 2 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 347 SDtfs, 555 SDslu, 657 SDs, 0 SdLazy, 652 SolverSat, 79 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 103 GetRequests, 51 SyntacticMatches, 6 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=77occurred in iteration=7, 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, 8 MinimizatonAttempts, 52 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 240 NumberOfCodeBlocks, 240 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 201 ConstructedInterpolants, 12 QuantifiedInterpolants, 27076 SizeOfPredicates, 7 NumberOfNonLiveVariables, 271 ConjunctsInSsa, 21 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 12/20 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-Benchmark-0-2018-02-04_13-20-25-445.csv Written .csv to /home/ultimate/work/ultimate/releaseScripts/default/UAutomizer-linux/../../../releaseScripts/default/UAutomizer-linux/csv/960521-1_1_false-valid-deref.i_svcomp-DerefFreeMemtrack-32bit-Automizer_Camel.epf_AutomizerC.xml/Csv-TraceAbstractionBenchmarks-0-2018-02-04_13-20-25-445.csv Received shutdown request...