java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --traceabstraction.dump.automata.to.the.following.directory dump --rcfgbuilder.size.of.a.code.block SingleStatement --cacsl2boogietranslator.bitprecise.bitfields false -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:41:31,716 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:41:31,720 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:41:31,736 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:41:31,736 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:41:31,737 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:41:31,738 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:41:31,740 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:41:31,742 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:41:31,743 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:41:31,744 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:41:31,744 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:41:31,745 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:41:31,749 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:41:31,751 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:41:31,752 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:41:31,752 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:41:31,754 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:41:31,756 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:41:31,758 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:41:31,759 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:41:31,761 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:41:31,763 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:41:31,763 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:41:31,763 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:41:31,764 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:41:31,765 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:41:31,766 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:41:31,767 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:41:31,768 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:41:31,768 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:41:31,769 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:41:31,769 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:41:31,770 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:41:31,771 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:41:31,771 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:41:31,772 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2018-10-10 14:41:31,800 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:41:31,801 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:41:31,805 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:41:31,806 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:41:31,807 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:41:31,807 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:41:31,807 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:41:31,807 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:41:31,807 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:41:31,808 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:41:31,808 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:41:31,808 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:41:31,808 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:41:31,808 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:41:31,809 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:41:31,809 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:41:31,809 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:41:31,809 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:41:31,809 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:41:31,810 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:41:31,810 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:41:31,811 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:41:31,811 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:41:31,811 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:41:31,811 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:41:31,811 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Dump automata to the following directory -> dump Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder: Size of a code block -> SingleStatement Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Bitprecise bitfields -> false [2018-10-10 14:41:31,882 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:41:31,903 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:41:31,908 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:41:31,910 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:41:31,910 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:41:31,911 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:32,265 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de5cd3bbc/0e3c62d44ddb45788694b6eedda2f464/FLAG420d0505d [2018-10-10 14:41:32,565 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:41:32,566 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:32,588 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de5cd3bbc/0e3c62d44ddb45788694b6eedda2f464/FLAG420d0505d [2018-10-10 14:41:32,603 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/de5cd3bbc/0e3c62d44ddb45788694b6eedda2f464 [2018-10-10 14:41:32,614 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:41:32,615 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:41:32,617 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:32,617 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:41:32,621 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:41:32,622 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:32" (1/1) ... [2018-10-10 14:41:32,625 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@236c3895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:32, skipping insertion in model container [2018-10-10 14:41:32,626 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:41:32" (1/1) ... [2018-10-10 14:41:32,637 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:41:32,682 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:41:32,941 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:32,952 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:41:33,011 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:41:33,078 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:41:33,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:33 WrapperNode [2018-10-10 14:41:33,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:41:33,080 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:33,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:41:33,081 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:41:33,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:33" (1/1) ... [2018-10-10 14:41:33,116 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:33" (1/1) ... [2018-10-10 14:41:33,158 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:41:33,159 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:41:33,159 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:41:33,159 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:41:33,170 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:33" (1/1) ... [2018-10-10 14:41:33,170 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:33" (1/1) ... [2018-10-10 14:41:33,175 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:33" (1/1) ... [2018-10-10 14:41:33,175 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:33" (1/1) ... [2018-10-10 14:41:33,187 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:33" (1/1) ... [2018-10-10 14:41:33,192 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:33" (1/1) ... [2018-10-10 14:41:33,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:33" (1/1) ... [2018-10-10 14:41:33,198 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:41:33,198 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:41:33,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:41:33,199 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:41:33,200 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:33" (1/1) ... No working directory specified, using /storage/repos/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-10-10 14:41:33,361 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:41:33,362 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:41:34,231 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:41:34,232 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:34 BoogieIcfgContainer [2018-10-10 14:41:34,232 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:41:34,233 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:41:34,233 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:41:34,236 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:41:34,237 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:41:32" (1/3) ... [2018-10-10 14:41:34,237 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2a1f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:34, skipping insertion in model container [2018-10-10 14:41:34,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:41:33" (2/3) ... [2018-10-10 14:41:34,238 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a2a1f3b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:41:34, skipping insertion in model container [2018-10-10 14:41:34,238 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:41:34" (3/3) ... [2018-10-10 14:41:34,240 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:41:34,250 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:41:34,259 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-10-10 14:41:34,276 INFO L257 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2018-10-10 14:41:34,307 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:41:34,310 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:41:34,310 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:41:34,310 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:41:34,311 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:41:34,311 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:41:34,311 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:41:34,311 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:41:34,311 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:41:34,332 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states. [2018-10-10 14:41:34,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-10 14:41:34,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:34,343 INFO L375 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] [2018-10-10 14:41:34,345 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:34,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:34,352 INFO L82 PathProgramCache]: Analyzing trace with hash 2021757871, now seen corresponding path program 1 times [2018-10-10 14:41:34,355 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:34,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:34,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:34,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:34,405 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:34,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:34,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:34,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:34,541 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 14:41:34,548 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:41:34,562 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:41:34,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:41:34,565 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 3 states. [2018-10-10 14:41:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:34,730 INFO L93 Difference]: Finished difference Result 164 states and 169 transitions. [2018-10-10 14:41:34,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:41:34,733 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-10 14:41:34,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:34,747 INFO L225 Difference]: With dead ends: 164 [2018-10-10 14:41:34,747 INFO L226 Difference]: Without dead ends: 157 [2018-10-10 14:41:34,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:41:34,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-10 14:41:34,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-10-10 14:41:34,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-10 14:41:34,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2018-10-10 14:41:34,796 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 23 [2018-10-10 14:41:34,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:34,796 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2018-10-10 14:41:34,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:41:34,796 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2018-10-10 14:41:34,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-10 14:41:34,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:34,798 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:34,799 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:34,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:34,799 INFO L82 PathProgramCache]: Analyzing trace with hash -1217943548, now seen corresponding path program 1 times [2018-10-10 14:41:34,799 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:34,800 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:34,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:34,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:34,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:34,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:35,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:35,157 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:41:35,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:41:35,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:41:35,162 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:41:35,162 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 8 states. [2018-10-10 14:41:35,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:35,963 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2018-10-10 14:41:35,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:41:35,966 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-10-10 14:41:35,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:35,969 INFO L225 Difference]: With dead ends: 156 [2018-10-10 14:41:35,969 INFO L226 Difference]: Without dead ends: 156 [2018-10-10 14:41:35,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:41:35,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-10 14:41:35,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-10-10 14:41:35,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-10 14:41:35,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 160 transitions. [2018-10-10 14:41:35,983 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 160 transitions. Word has length 51 [2018-10-10 14:41:35,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:35,983 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 160 transitions. [2018-10-10 14:41:35,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:41:35,984 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2018-10-10 14:41:35,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-10 14:41:35,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:35,986 INFO L375 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:35,986 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:35,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:35,987 INFO L82 PathProgramCache]: Analyzing trace with hash 898455783, now seen corresponding path program 1 times [2018-10-10 14:41:35,987 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:35,987 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:35,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:35,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:35,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:36,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:36,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:36,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:36,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:41:36,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:41:36,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:41:36,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:41:36,487 INFO L87 Difference]: Start difference. First operand 156 states and 160 transitions. Second operand 13 states. [2018-10-10 14:41:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:37,417 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-10-10 14:41:37,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:41:37,418 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-10-10 14:41:37,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:37,421 INFO L225 Difference]: With dead ends: 155 [2018-10-10 14:41:37,422 INFO L226 Difference]: Without dead ends: 155 [2018-10-10 14:41:37,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:41:37,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-10 14:41:37,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-10-10 14:41:37,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-10 14:41:37,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2018-10-10 14:41:37,433 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 52 [2018-10-10 14:41:37,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:37,433 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2018-10-10 14:41:37,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:41:37,434 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2018-10-10 14:41:37,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-10 14:41:37,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:37,435 INFO L375 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, 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-10-10 14:41:37,436 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:37,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:37,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1397723670, now seen corresponding path program 1 times [2018-10-10 14:41:37,437 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:37,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:37,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:37,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:37,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:37,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:37,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:37,533 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:37,533 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:41:37,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:41:37,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:41:37,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:41:37,535 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand 6 states. [2018-10-10 14:41:37,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:37,792 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2018-10-10 14:41:37,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:41:37,792 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-10-10 14:41:37,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:37,795 INFO L225 Difference]: With dead ends: 154 [2018-10-10 14:41:37,795 INFO L226 Difference]: Without dead ends: 154 [2018-10-10 14:41:37,796 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:41:37,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-10 14:41:37,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-10-10 14:41:37,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-10 14:41:37,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2018-10-10 14:41:37,806 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 61 [2018-10-10 14:41:37,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:37,807 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2018-10-10 14:41:37,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:41:37,807 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-10-10 14:41:37,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-10 14:41:37,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:37,809 INFO L375 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, 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-10-10 14:41:37,810 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:37,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:37,810 INFO L82 PathProgramCache]: Analyzing trace with hash -379760691, now seen corresponding path program 1 times [2018-10-10 14:41:37,811 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:37,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:37,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:37,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:37,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:37,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:38,190 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:38,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:38,191 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:41:38,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:41:38,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:41:38,192 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:41:38,192 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand 11 states. [2018-10-10 14:41:38,680 WARN L178 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-10 14:41:39,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:39,141 INFO L93 Difference]: Finished difference Result 173 states and 177 transitions. [2018-10-10 14:41:39,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:41:39,141 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-10-10 14:41:39,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:39,143 INFO L225 Difference]: With dead ends: 173 [2018-10-10 14:41:39,143 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 14:41:39,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:41:39,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 14:41:39,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 153. [2018-10-10 14:41:39,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-10 14:41:39,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2018-10-10 14:41:39,153 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 62 [2018-10-10 14:41:39,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:39,154 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2018-10-10 14:41:39,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:41:39,154 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-10-10 14:41:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-10 14:41:39,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:39,156 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:39,157 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:39,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:39,157 INFO L82 PathProgramCache]: Analyzing trace with hash -1168676233, now seen corresponding path program 1 times [2018-10-10 14:41:39,158 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:39,158 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:39,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:39,159 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:39,159 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:39,290 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:39,290 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:39,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:41:39,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:41:39,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:41:39,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:41:39,292 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 9 states. [2018-10-10 14:41:39,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:39,982 INFO L93 Difference]: Finished difference Result 173 states and 178 transitions. [2018-10-10 14:41:39,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:41:39,983 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 78 [2018-10-10 14:41:39,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:39,985 INFO L225 Difference]: With dead ends: 173 [2018-10-10 14:41:39,986 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 14:41:39,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:41:39,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 14:41:39,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 157. [2018-10-10 14:41:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-10 14:41:39,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2018-10-10 14:41:39,995 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 78 [2018-10-10 14:41:39,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:39,996 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2018-10-10 14:41:39,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:41:39,996 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2018-10-10 14:41:39,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-10 14:41:39,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:39,999 INFO L375 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:39,999 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:40,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:40,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1869224713, now seen corresponding path program 1 times [2018-10-10 14:41:40,000 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:40,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:40,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:40,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:40,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:40,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:40,271 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:40,272 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:40,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:41:40,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:41:40,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:41:40,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:41:40,274 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 12 states. [2018-10-10 14:41:40,631 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-10 14:41:40,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:40,907 INFO L93 Difference]: Finished difference Result 180 states and 185 transitions. [2018-10-10 14:41:40,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:41:40,908 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 79 [2018-10-10 14:41:40,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:40,910 INFO L225 Difference]: With dead ends: 180 [2018-10-10 14:41:40,910 INFO L226 Difference]: Without dead ends: 180 [2018-10-10 14:41:40,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=165, Invalid=341, Unknown=0, NotChecked=0, Total=506 [2018-10-10 14:41:40,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-10 14:41:40,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 158. [2018-10-10 14:41:40,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-10 14:41:40,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 162 transitions. [2018-10-10 14:41:40,917 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 162 transitions. Word has length 79 [2018-10-10 14:41:40,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:40,918 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 162 transitions. [2018-10-10 14:41:40,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:41:40,918 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 162 transitions. [2018-10-10 14:41:40,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-10 14:41:40,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:40,920 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 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, 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, 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-10-10 14:41:40,921 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:40,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:40,921 INFO L82 PathProgramCache]: Analyzing trace with hash -76851738, now seen corresponding path program 1 times [2018-10-10 14:41:40,922 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:40,922 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:40,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:40,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:40,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:40,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:41,095 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-10 14:41:41,095 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:41:41,095 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-10 14:41:41,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:41,181 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:41:41,224 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 6 treesize of output 5 [2018-10-10 14:41:41,227 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:41,234 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:41:41,235 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:41:41,323 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-10-10 14:41:41,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:41:41,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 9 [2018-10-10 14:41:41,398 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/cstrcat-alloca_true-valid-memsafety_true-termination.i_8.bpl [2018-10-10 14:41:41,403 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:41:41,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:41:41,404 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:41:41,404 INFO L87 Difference]: Start difference. First operand 158 states and 162 transitions. Second operand 10 states. [2018-10-10 14:41:41,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:41,906 INFO L93 Difference]: Finished difference Result 160 states and 164 transitions. [2018-10-10 14:41:41,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:41:41,907 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 94 [2018-10-10 14:41:41,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:41,908 INFO L225 Difference]: With dead ends: 160 [2018-10-10 14:41:41,909 INFO L226 Difference]: Without dead ends: 160 [2018-10-10 14:41:41,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 91 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=101, Invalid=205, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:41:41,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-10 14:41:41,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 157. [2018-10-10 14:41:41,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-10 14:41:41,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2018-10-10 14:41:41,915 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 94 [2018-10-10 14:41:41,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:41,916 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2018-10-10 14:41:41,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:41:41,916 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2018-10-10 14:41:41,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 14:41:41,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:41,918 INFO L375 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, 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, 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-10-10 14:41:41,919 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:41,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:41,919 INFO L82 PathProgramCache]: Analyzing trace with hash 78835809, now seen corresponding path program 1 times [2018-10-10 14:41:41,919 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:41,920 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:41,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:41,921 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:41,921 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:41,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:42,125 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:42,126 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:42,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:41:42,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:41:42,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:41:42,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:41:42,128 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 9 states. [2018-10-10 14:41:42,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:42,603 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2018-10-10 14:41:42,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:41:42,603 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-10-10 14:41:42,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:42,605 INFO L225 Difference]: With dead ends: 156 [2018-10-10 14:41:42,606 INFO L226 Difference]: Without dead ends: 156 [2018-10-10 14:41:42,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:41:42,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-10 14:41:42,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-10-10 14:41:42,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-10 14:41:42,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 160 transitions. [2018-10-10 14:41:42,610 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 160 transitions. Word has length 95 [2018-10-10 14:41:42,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:42,611 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 160 transitions. [2018-10-10 14:41:42,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:41:42,611 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2018-10-10 14:41:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 14:41:42,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:42,613 INFO L375 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, 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, 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-10-10 14:41:42,614 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:42,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:42,614 INFO L82 PathProgramCache]: Analyzing trace with hash 1912563560, now seen corresponding path program 1 times [2018-10-10 14:41:42,615 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:42,615 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:42,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:42,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:42,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:42,940 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:42,941 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:41:42,941 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/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-10-10 14:41:42,958 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:43,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:43,011 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:41:43,040 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 6 treesize of output 5 [2018-10-10 14:41:43,040 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:43,141 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:41:43,141 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:41:43,625 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:43,646 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:41:43,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 15 [2018-10-10 14:41:43,671 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/cstrcat-alloca_true-valid-memsafety_true-termination.i_10.bpl [2018-10-10 14:41:43,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:41:43,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:41:43,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=209, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:41:43,673 INFO L87 Difference]: Start difference. First operand 156 states and 160 transitions. Second operand 16 states. [2018-10-10 14:41:44,869 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-10 14:41:45,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:45,125 INFO L93 Difference]: Finished difference Result 198 states and 204 transitions. [2018-10-10 14:41:45,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:41:45,125 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 95 [2018-10-10 14:41:45,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:45,126 INFO L225 Difference]: With dead ends: 198 [2018-10-10 14:41:45,127 INFO L226 Difference]: Without dead ends: 198 [2018-10-10 14:41:45,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 88 SyntacticMatches, 5 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=240, Invalid=630, Unknown=0, NotChecked=0, Total=870 [2018-10-10 14:41:45,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-10 14:41:45,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 172. [2018-10-10 14:41:45,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-10 14:41:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 177 transitions. [2018-10-10 14:41:45,131 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 177 transitions. Word has length 95 [2018-10-10 14:41:45,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:45,132 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 177 transitions. [2018-10-10 14:41:45,132 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:41:45,132 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 177 transitions. [2018-10-10 14:41:45,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-10 14:41:45,134 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:45,134 INFO L375 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, 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, 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-10-10 14:41:45,134 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:45,135 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:45,135 INFO L82 PathProgramCache]: Analyzing trace with hash -1851057042, now seen corresponding path program 1 times [2018-10-10 14:41:45,135 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:45,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:45,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:45,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:45,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:45,654 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:45,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:45,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-10 14:41:45,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 14:41:45,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 14:41:45,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:41:45,656 INFO L87 Difference]: Start difference. First operand 172 states and 177 transitions. Second operand 17 states. [2018-10-10 14:41:46,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:46,744 INFO L93 Difference]: Finished difference Result 234 states and 239 transitions. [2018-10-10 14:41:46,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 14:41:46,744 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-10-10 14:41:46,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:46,746 INFO L225 Difference]: With dead ends: 234 [2018-10-10 14:41:46,746 INFO L226 Difference]: Without dead ends: 234 [2018-10-10 14:41:46,747 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=298, Invalid=1262, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 14:41:46,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-10 14:41:46,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 181. [2018-10-10 14:41:46,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-10 14:41:46,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 186 transitions. [2018-10-10 14:41:46,752 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 186 transitions. Word has length 96 [2018-10-10 14:41:46,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:46,752 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 186 transitions. [2018-10-10 14:41:46,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 14:41:46,753 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 186 transitions. [2018-10-10 14:41:46,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-10 14:41:46,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:46,754 INFO L375 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, 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, 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, 1] [2018-10-10 14:41:46,755 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:46,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:46,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1601404684, now seen corresponding path program 1 times [2018-10-10 14:41:46,755 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:46,756 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:46,756 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:46,756 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:46,757 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:46,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:47,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-10-10 14:41:47,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:47,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:41:47,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:41:47,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:41:47,348 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:41:47,349 INFO L87 Difference]: Start difference. First operand 181 states and 186 transitions. Second operand 10 states. [2018-10-10 14:41:47,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:47,883 INFO L93 Difference]: Finished difference Result 234 states and 240 transitions. [2018-10-10 14:41:47,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:41:47,884 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 106 [2018-10-10 14:41:47,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:47,886 INFO L225 Difference]: With dead ends: 234 [2018-10-10 14:41:47,886 INFO L226 Difference]: Without dead ends: 234 [2018-10-10 14:41:47,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=99, Invalid=207, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:41:47,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-10 14:41:47,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 220. [2018-10-10 14:41:47,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 220 states. [2018-10-10 14:41:47,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 228 transitions. [2018-10-10 14:41:47,892 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 228 transitions. Word has length 106 [2018-10-10 14:41:47,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:47,892 INFO L481 AbstractCegarLoop]: Abstraction has 220 states and 228 transitions. [2018-10-10 14:41:47,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:41:47,892 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 228 transitions. [2018-10-10 14:41:47,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-10 14:41:47,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:47,894 INFO L375 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, 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, 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, 1, 1] [2018-10-10 14:41:47,894 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:47,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:47,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1896062536, now seen corresponding path program 1 times [2018-10-10 14:41:47,895 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:47,895 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:47,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:47,896 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:47,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:47,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:48,954 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:48,954 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:41:48,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:41:48,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:41:48,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:41:48,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:41:48,956 INFO L87 Difference]: Start difference. First operand 220 states and 228 transitions. Second operand 13 states. [2018-10-10 14:41:49,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:41:49,666 INFO L93 Difference]: Finished difference Result 283 states and 291 transitions. [2018-10-10 14:41:49,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:41:49,666 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 107 [2018-10-10 14:41:49,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:41:49,668 INFO L225 Difference]: With dead ends: 283 [2018-10-10 14:41:49,668 INFO L226 Difference]: Without dead ends: 283 [2018-10-10 14:41:49,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2018-10-10 14:41:49,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-10 14:41:49,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 231. [2018-10-10 14:41:49,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-10 14:41:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 239 transitions. [2018-10-10 14:41:49,674 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 239 transitions. Word has length 107 [2018-10-10 14:41:49,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:41:49,675 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 239 transitions. [2018-10-10 14:41:49,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:41:49,675 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 239 transitions. [2018-10-10 14:41:49,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-10 14:41:49,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:41:49,676 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:41:49,677 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:41:49,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:41:49,677 INFO L82 PathProgramCache]: Analyzing trace with hash 1059055577, now seen corresponding path program 2 times [2018-10-10 14:41:49,677 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:41:49,677 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:41:49,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:49,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:41:49,679 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:41:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:41:50,787 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:50,788 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:41:50,788 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:41:50,796 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:41:50,860 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:41:50,860 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:41:50,868 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:41:50,885 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 6 treesize of output 5 [2018-10-10 14:41:50,885 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:50,902 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:41:50,902 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-10-10 14:41:51,019 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:41:51,021 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-10-10 14:41:51,021 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:41:51,025 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:41:51,034 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:41:51,035 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-10-10 14:41:51,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2018-10-10 14:41:51,572 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 12 [2018-10-10 14:41:51,574 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:41:51,581 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:41:51,594 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:41:51,595 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:40 [2018-10-10 14:41:51,935 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:41:51,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:41:51,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 36 [2018-10-10 14:41:51,958 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:41:51,963 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:41:51,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:41:51 BoogieIcfgContainer [2018-10-10 14:41:51,964 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:41:51,965 INFO L168 Benchmark]: Toolchain (without parser) took 19350.14 ms. Allocated memory was 1.5 GB in the beginning and 2.4 GB in the end (delta: 877.1 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -157.0 MB). Peak memory consumption was 720.2 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:51,966 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:41:51,966 INFO L168 Benchmark]: CACSL2BoogieTranslator took 463.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:51,967 INFO L168 Benchmark]: Boogie Procedure Inliner took 77.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:41:51,968 INFO L168 Benchmark]: Boogie Preprocessor took 39.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:41:51,968 INFO L168 Benchmark]: RCFGBuilder took 1033.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -755.5 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:51,969 INFO L168 Benchmark]: TraceAbstraction took 17731.07 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 136.8 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 577.4 MB). Peak memory consumption was 714.2 MB. Max. memory is 7.1 GB. [2018-10-10 14:41:51,973 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 463.23 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 77.90 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 39.29 ms. Allocated memory is still 1.5 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1033.74 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 740.3 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -755.5 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 17731.07 ms. Allocated memory was 2.3 GB in the beginning and 2.4 GB in the end (delta: 136.8 MB). Free memory was 2.2 GB in the beginning and 1.6 GB in the end (delta: 577.4 MB). Peak memory consumption was 714.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: 549]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 549). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 14). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 163 locations, 11 error locations. TIMEOUT Result, 17.6s OverallTime, 14 OverallIterations, 3 TraceHistogramMax, 9.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1688 SDtfs, 9249 SDslu, 6133 SDs, 0 SdLazy, 2944 SolverSat, 86 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 430 GetRequests, 194 SyntacticMatches, 10 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 487 ImplicationChecksByTransitivity, 8.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=231occurred in iteration=13, 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.1s AutomataMinimizationTime, 13 MinimizatonAttempts, 206 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.1s InterpolantComputationTime, 1188 NumberOfCodeBlocks, 1188 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 1173 ConstructedInterpolants, 0 QuantifiedInterpolants, 491667 SizeOfPredicates, 28 NumberOfNonLiveVariables, 374 ConjunctsInSsa, 57 ConjunctsInUnsatCore, 15 InterpolantComputations, 11 PerfectInterpolantSequences, 6/18 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...