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/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:42:23,250 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:42:23,255 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:42:23,272 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:42:23,272 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:42:23,273 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:42:23,275 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:42:23,276 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:42:23,278 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:42:23,279 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:42:23,280 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:42:23,280 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:42:23,281 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:42:23,282 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:42:23,283 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:42:23,284 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:42:23,285 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:42:23,287 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:42:23,289 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:42:23,294 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:42:23,299 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:42:23,300 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:42:23,304 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:42:23,304 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:42:23,304 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:42:23,305 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:42:23,307 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:42:23,308 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:42:23,312 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:42:23,313 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:42:23,313 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:42:23,313 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:42:23,316 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:42:23,316 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:42:23,317 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:42:23,318 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:42:23,318 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:42:23,340 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:42:23,341 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:42:23,342 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:42:23,342 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:42:23,343 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:42:23,343 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:42:23,344 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:42:23,344 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:42:23,344 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:42:23,344 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:42:23,344 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:42:23,345 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:42:23,345 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:42:23,345 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:42:23,345 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:42:23,345 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:42:23,346 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:42:23,349 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:42:23,349 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:42:23,349 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:42:23,349 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:42:23,349 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:42:23,350 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:42:23,350 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:42:23,350 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:42:23,350 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:42:23,416 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:42:23,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:42:23,432 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:42:23,434 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:42:23,434 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:42:23,435 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:23,757 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54403c511/c3aed00dd9a94cc7abbf676d5401d3b8/FLAG53865a7bd [2018-10-10 14:42:24,059 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:42:24,060 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:24,073 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54403c511/c3aed00dd9a94cc7abbf676d5401d3b8/FLAG53865a7bd [2018-10-10 14:42:24,086 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/54403c511/c3aed00dd9a94cc7abbf676d5401d3b8 [2018-10-10 14:42:24,096 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:42:24,097 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:42:24,099 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:24,099 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:42:24,103 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:42:24,104 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:24" (1/1) ... [2018-10-10 14:42:24,106 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4e8e3f40 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:24, skipping insertion in model container [2018-10-10 14:42:24,107 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:24" (1/1) ... [2018-10-10 14:42:24,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:42:24,168 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:42:24,415 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:24,427 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:42:24,489 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:24,541 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:42:24,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:24 WrapperNode [2018-10-10 14:42:24,542 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:24,543 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:24,543 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:42:24,543 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:42:24,553 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:42:24" (1/1) ... [2018-10-10 14:42:24,569 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:42:24" (1/1) ... [2018-10-10 14:42:24,600 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:24,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:42:24,601 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:42:24,601 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:42:24,609 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:24" (1/1) ... [2018-10-10 14:42:24,609 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:24" (1/1) ... [2018-10-10 14:42:24,614 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:24" (1/1) ... [2018-10-10 14:42:24,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:24" (1/1) ... [2018-10-10 14:42:24,621 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:24" (1/1) ... [2018-10-10 14:42:24,626 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:24" (1/1) ... [2018-10-10 14:42:24,629 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:24" (1/1) ... [2018-10-10 14:42:24,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:42:24,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:42:24,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:42:24,633 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:42:24,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:24" (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:42:24,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:42:24,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:42:25,618 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:42:25,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:25 BoogieIcfgContainer [2018-10-10 14:42:25,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:42:25,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:42:25,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:42:25,623 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:42:25,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:42:24" (1/3) ... [2018-10-10 14:42:25,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c268ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:25, skipping insertion in model container [2018-10-10 14:42:25,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:24" (2/3) ... [2018-10-10 14:42:25,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@32c268ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:25, skipping insertion in model container [2018-10-10 14:42:25,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:25" (3/3) ... [2018-10-10 14:42:25,627 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:25,637 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:42:25,646 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 9 error locations. [2018-10-10 14:42:25,663 INFO L257 AbstractCegarLoop]: Starting to check reachability of 9 error locations. [2018-10-10 14:42:25,688 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:42:25,689 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:42:25,689 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:42:25,689 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:42:25,690 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:42:25,691 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:42:25,691 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:42:25,691 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:42:25,691 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:42:25,711 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states. [2018-10-10 14:42:25,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-10 14:42:25,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:25,721 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] [2018-10-10 14:42:25,724 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:25,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:25,729 INFO L82 PathProgramCache]: Analyzing trace with hash 989039711, now seen corresponding path program 1 times [2018-10-10 14:42:25,732 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:25,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:25,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:25,780 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:25,780 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:25,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:26,028 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:42:26,031 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:26,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:42:26,037 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:42:26,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:42:26,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:42:26,057 INFO L87 Difference]: Start difference. First operand 154 states. Second operand 6 states. [2018-10-10 14:42:26,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:26,733 INFO L93 Difference]: Finished difference Result 153 states and 158 transitions. [2018-10-10 14:42:26,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:42:26,734 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 46 [2018-10-10 14:42:26,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:26,748 INFO L225 Difference]: With dead ends: 153 [2018-10-10 14:42:26,748 INFO L226 Difference]: Without dead ends: 148 [2018-10-10 14:42:26,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:26,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-10 14:42:26,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2018-10-10 14:42:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-10 14:42:26,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 153 transitions. [2018-10-10 14:42:26,797 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 153 transitions. Word has length 46 [2018-10-10 14:42:26,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:26,797 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 153 transitions. [2018-10-10 14:42:26,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:42:26,798 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 153 transitions. [2018-10-10 14:42:26,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 14:42:26,799 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:26,799 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] [2018-10-10 14:42:26,800 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:26,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:26,800 INFO L82 PathProgramCache]: Analyzing trace with hash 595460060, now seen corresponding path program 1 times [2018-10-10 14:42:26,801 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:26,801 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:26,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:26,802 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:26,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:26,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:27,464 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:42:27,464 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:27,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:27,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:27,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:27,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:27,468 INFO L87 Difference]: Start difference. First operand 148 states and 153 transitions. Second operand 9 states. [2018-10-10 14:42:28,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:28,109 INFO L93 Difference]: Finished difference Result 188 states and 192 transitions. [2018-10-10 14:42:28,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:42:28,109 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 47 [2018-10-10 14:42:28,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:28,112 INFO L225 Difference]: With dead ends: 188 [2018-10-10 14:42:28,112 INFO L226 Difference]: Without dead ends: 188 [2018-10-10 14:42:28,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:42:28,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-10 14:42:28,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 147. [2018-10-10 14:42:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-10 14:42:28,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 152 transitions. [2018-10-10 14:42:28,126 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 152 transitions. Word has length 47 [2018-10-10 14:42:28,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:28,127 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 152 transitions. [2018-10-10 14:42:28,127 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:28,127 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 152 transitions. [2018-10-10 14:42:28,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-10 14:42:28,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:28,130 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] [2018-10-10 14:42:28,130 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:28,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:28,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1847867438, now seen corresponding path program 1 times [2018-10-10 14:42:28,131 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:28,131 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:28,132 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:28,132 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:28,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:28,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:28,328 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:42:28,328 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:28,328 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:42:28,329 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:42:28,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:42:28,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:42:28,330 INFO L87 Difference]: Start difference. First operand 147 states and 152 transitions. Second operand 10 states. [2018-10-10 14:42:28,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:28,838 INFO L93 Difference]: Finished difference Result 162 states and 167 transitions. [2018-10-10 14:42:28,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:42:28,839 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 70 [2018-10-10 14:42:28,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:28,842 INFO L225 Difference]: With dead ends: 162 [2018-10-10 14:42:28,843 INFO L226 Difference]: Without dead ends: 162 [2018-10-10 14:42:28,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2018-10-10 14:42:28,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-10 14:42:28,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 146. [2018-10-10 14:42:28,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-10 14:42:28,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 151 transitions. [2018-10-10 14:42:28,855 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 151 transitions. Word has length 70 [2018-10-10 14:42:28,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:28,855 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 151 transitions. [2018-10-10 14:42:28,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:42:28,856 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 151 transitions. [2018-10-10 14:42:28,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-10 14:42:28,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:28,857 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] [2018-10-10 14:42:28,858 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:28,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:28,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1449315852, now seen corresponding path program 1 times [2018-10-10 14:42:28,859 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:28,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:28,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:28,863 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:28,863 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:28,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:29,147 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:42:29,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:29,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:42:29,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:42:29,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:42:29,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:29,149 INFO L87 Difference]: Start difference. First operand 146 states and 151 transitions. Second operand 13 states. [2018-10-10 14:42:29,632 WARN L178 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 38 [2018-10-10 14:42:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:30,444 INFO L93 Difference]: Finished difference Result 234 states and 241 transitions. [2018-10-10 14:42:30,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:42:30,444 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 71 [2018-10-10 14:42:30,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:30,451 INFO L225 Difference]: With dead ends: 234 [2018-10-10 14:42:30,451 INFO L226 Difference]: Without dead ends: 234 [2018-10-10 14:42:30,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=224, Invalid=478, Unknown=0, NotChecked=0, Total=702 [2018-10-10 14:42:30,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-10 14:42:30,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 155. [2018-10-10 14:42:30,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-10 14:42:30,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 160 transitions. [2018-10-10 14:42:30,470 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 160 transitions. Word has length 71 [2018-10-10 14:42:30,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:30,474 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 160 transitions. [2018-10-10 14:42:30,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:42:30,474 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 160 transitions. [2018-10-10 14:42:30,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-10 14:42:30,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:30,476 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] [2018-10-10 14:42:30,477 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:30,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:30,477 INFO L82 PathProgramCache]: Analyzing trace with hash 551918865, now seen corresponding path program 1 times [2018-10-10 14:42:30,477 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:30,478 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:30,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:30,482 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:30,482 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:30,812 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:42:30,813 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:30,813 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:42:30,814 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:42:30,814 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:42:30,814 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:42:30,815 INFO L87 Difference]: Start difference. First operand 155 states and 160 transitions. Second operand 7 states. [2018-10-10 14:42:30,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:30,949 INFO L93 Difference]: Finished difference Result 185 states and 190 transitions. [2018-10-10 14:42:30,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:42:30,949 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 80 [2018-10-10 14:42:30,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:30,951 INFO L225 Difference]: With dead ends: 185 [2018-10-10 14:42:30,951 INFO L226 Difference]: Without dead ends: 185 [2018-10-10 14:42:30,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:42:30,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-10 14:42:30,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 155. [2018-10-10 14:42:30,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-10 14:42:30,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2018-10-10 14:42:30,959 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 80 [2018-10-10 14:42:30,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:30,960 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2018-10-10 14:42:30,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:42:30,960 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2018-10-10 14:42:30,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-10 14:42:30,962 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:30,962 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] [2018-10-10 14:42:30,962 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:30,963 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:30,963 INFO L82 PathProgramCache]: Analyzing trace with hash 421835762, now seen corresponding path program 1 times [2018-10-10 14:42:30,963 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:30,963 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:30,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:30,964 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:30,964 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:30,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:31,187 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:42:31,187 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:31,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:42:31,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:42:31,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:42:31,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:42:31,189 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand 12 states. [2018-10-10 14:42:31,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:31,844 INFO L93 Difference]: Finished difference Result 171 states and 176 transitions. [2018-10-10 14:42:31,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:42:31,845 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 81 [2018-10-10 14:42:31,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:31,847 INFO L225 Difference]: With dead ends: 171 [2018-10-10 14:42:31,847 INFO L226 Difference]: Without dead ends: 171 [2018-10-10 14:42:31,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2018-10-10 14:42:31,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-10 14:42:31,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 154. [2018-10-10 14:42:31,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-10 14:42:31,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2018-10-10 14:42:31,855 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 81 [2018-10-10 14:42:31,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:31,855 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2018-10-10 14:42:31,855 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:42:31,855 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-10-10 14:42:31,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-10 14:42:31,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:31,857 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] [2018-10-10 14:42:31,858 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:31,858 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:31,858 INFO L82 PathProgramCache]: Analyzing trace with hash 192006869, now seen corresponding path program 1 times [2018-10-10 14:42:31,858 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:31,859 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:31,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:31,860 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:31,860 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:31,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:32,318 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:42:32,319 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:32,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-10 14:42:32,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 14:42:32,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 14:42:32,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=237, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:42:32,320 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand 17 states. [2018-10-10 14:42:33,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:33,583 INFO L93 Difference]: Finished difference Result 233 states and 239 transitions. [2018-10-10 14:42:33,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 14:42:33,583 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 82 [2018-10-10 14:42:33,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:33,586 INFO L225 Difference]: With dead ends: 233 [2018-10-10 14:42:33,586 INFO L226 Difference]: Without dead ends: 233 [2018-10-10 14:42:33,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=244, Invalid=1016, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 14:42:33,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-10 14:42:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 165. [2018-10-10 14:42:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-10 14:42:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 169 transitions. [2018-10-10 14:42:33,592 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 169 transitions. Word has length 82 [2018-10-10 14:42:33,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:33,592 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 169 transitions. [2018-10-10 14:42:33,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 14:42:33,593 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 169 transitions. [2018-10-10 14:42:33,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-10 14:42:33,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:33,595 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] [2018-10-10 14:42:33,595 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:33,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:33,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1547132955, now seen corresponding path program 1 times [2018-10-10 14:42:33,595 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:33,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:33,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:33,597 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:33,597 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:33,736 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:42:33,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:33,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:42:33,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:42:33,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:42:33,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:42:33,738 INFO L87 Difference]: Start difference. First operand 165 states and 169 transitions. Second operand 8 states. [2018-10-10 14:42:33,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:33,918 INFO L93 Difference]: Finished difference Result 193 states and 197 transitions. [2018-10-10 14:42:33,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 14:42:33,919 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 102 [2018-10-10 14:42:33,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:33,921 INFO L225 Difference]: With dead ends: 193 [2018-10-10 14:42:33,921 INFO L226 Difference]: Without dead ends: 193 [2018-10-10 14:42:33,922 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:33,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-10 14:42:33,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 164. [2018-10-10 14:42:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-10 14:42:33,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 168 transitions. [2018-10-10 14:42:33,926 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 168 transitions. Word has length 102 [2018-10-10 14:42:33,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:33,926 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 168 transitions. [2018-10-10 14:42:33,926 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:42:33,927 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 168 transitions. [2018-10-10 14:42:33,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-10 14:42:33,928 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:33,928 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] [2018-10-10 14:42:33,929 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:33,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:33,929 INFO L82 PathProgramCache]: Analyzing trace with hash -716481180, now seen corresponding path program 1 times [2018-10-10 14:42:33,929 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:33,930 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:33,930 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:33,930 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:33,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:34,861 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:42:34,862 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:34,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2018-10-10 14:42:34,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 14:42:34,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 14:42:34,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=491, Unknown=0, NotChecked=0, Total=552 [2018-10-10 14:42:34,863 INFO L87 Difference]: Start difference. First operand 164 states and 168 transitions. Second operand 24 states. [2018-10-10 14:42:37,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:37,488 INFO L93 Difference]: Finished difference Result 229 states and 235 transitions. [2018-10-10 14:42:37,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 14:42:37,489 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 103 [2018-10-10 14:42:37,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:37,491 INFO L225 Difference]: With dead ends: 229 [2018-10-10 14:42:37,491 INFO L226 Difference]: Without dead ends: 229 [2018-10-10 14:42:37,493 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=370, Invalid=1886, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 14:42:37,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-10 14:42:37,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 185. [2018-10-10 14:42:37,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-10 14:42:37,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 191 transitions. [2018-10-10 14:42:37,497 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 191 transitions. Word has length 103 [2018-10-10 14:42:37,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:37,498 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 191 transitions. [2018-10-10 14:42:37,498 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 14:42:37,498 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 191 transitions. [2018-10-10 14:42:37,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-10 14:42:37,499 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:37,500 INFO L375 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:37,500 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:37,500 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:37,500 INFO L82 PathProgramCache]: Analyzing trace with hash -205183428, now seen corresponding path program 1 times [2018-10-10 14:42:37,501 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:37,501 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:37,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:37,502 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:37,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:37,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:38,294 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 10 DAG size of output: 9 [2018-10-10 14:42:38,683 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-10 14:42:38,940 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:38,940 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:38,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 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:42:38,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:39,019 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:39,149 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:42:39,151 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:39,158 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:39,159 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:42:39,416 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 16 treesize of output 13 [2018-10-10 14:42:39,418 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 13 treesize of output 12 [2018-10-10 14:42:39,418 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:39,420 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:39,426 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:39,426 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:20, output treesize:16 [2018-10-10 14:42:40,204 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 19 treesize of output 15 [2018-10-10 14:42:40,215 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 15 treesize of output 12 [2018-10-10 14:42:40,216 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:40,219 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:40,297 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:42:40,298 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:32, output treesize:27 [2018-10-10 14:42:40,807 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:40,830 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:40,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 39 [2018-10-10 14:42:40,875 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_10.bpl [2018-10-10 14:42:40,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 14:42:40,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 14:42:40,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1460, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 14:42:40,882 INFO L87 Difference]: Start difference. First operand 185 states and 191 transitions. Second operand 40 states. [2018-10-10 14:42:42,123 WARN L178 SmtUtils]: Spent 317.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 50 [2018-10-10 14:42:42,325 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 62 [2018-10-10 14:42:42,597 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 74 [2018-10-10 14:42:42,873 WARN L178 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 86 [2018-10-10 14:42:43,263 WARN L178 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 78 [2018-10-10 14:42:43,567 WARN L178 SmtUtils]: Spent 222.00 ms on a formula simplification. DAG size of input: 113 DAG size of output: 90 [2018-10-10 14:42:43,831 WARN L178 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 83 [2018-10-10 14:42:44,141 WARN L178 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 88 [2018-10-10 14:42:44,613 WARN L178 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 122 DAG size of output: 91 [2018-10-10 14:42:44,881 WARN L178 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 87 [2018-10-10 14:42:46,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:46,366 INFO L93 Difference]: Finished difference Result 341 states and 349 transitions. [2018-10-10 14:42:46,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 14:42:46,366 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 104 [2018-10-10 14:42:46,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:46,369 INFO L225 Difference]: With dead ends: 341 [2018-10-10 14:42:46,369 INFO L226 Difference]: Without dead ends: 341 [2018-10-10 14:42:46,371 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 603 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=774, Invalid=3648, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 14:42:46,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-10-10 14:42:46,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 201. [2018-10-10 14:42:46,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-10 14:42:46,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 208 transitions. [2018-10-10 14:42:46,377 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 208 transitions. Word has length 104 [2018-10-10 14:42:46,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:46,378 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 208 transitions. [2018-10-10 14:42:46,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 14:42:46,378 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 208 transitions. [2018-10-10 14:42:46,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-10 14:42:46,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:46,380 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2018-10-10 14:42:46,381 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:46,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:46,381 INFO L82 PathProgramCache]: Analyzing trace with hash 519533733, now seen corresponding path program 1 times [2018-10-10 14:42:46,382 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:46,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:46,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:46,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:46,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:46,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:46,998 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:46,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:46,999 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:42:47,007 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:47,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:47,065 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:47,149 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:42:47,149 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:47,155 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:47,155 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:10, output treesize:9 [2018-10-10 14:42:47,238 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:42:47,238 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:47,243 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:47,244 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:15, output treesize:14 [2018-10-10 14:42:47,375 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:47,376 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:47,377 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:42:47,377 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:47,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:47,382 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:42:47,424 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-10 14:42:47,424 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:47,433 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:47,434 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 [2018-10-10 14:42:48,274 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:48,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:48,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22] total 44 [2018-10-10 14:42:48,321 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_11.bpl [2018-10-10 14:42:48,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 14:42:48,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 14:42:48,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1868, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 14:42:48,325 INFO L87 Difference]: Start difference. First operand 201 states and 208 transitions. Second operand 45 states. [2018-10-10 14:42:50,663 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 44 [2018-10-10 14:42:50,886 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 50 [2018-10-10 14:42:51,110 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-10-10 14:42:51,273 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 52 [2018-10-10 14:42:51,925 WARN L178 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 52 [2018-10-10 14:42:52,711 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-10-10 14:42:53,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:53,288 INFO L93 Difference]: Finished difference Result 281 states and 290 transitions. [2018-10-10 14:42:53,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 14:42:53,288 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 115 [2018-10-10 14:42:53,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:53,290 INFO L225 Difference]: With dead ends: 281 [2018-10-10 14:42:53,290 INFO L226 Difference]: Without dead ends: 281 [2018-10-10 14:42:53,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 958 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=632, Invalid=4624, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 14:42:53,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-10 14:42:53,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 212. [2018-10-10 14:42:53,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-10 14:42:53,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 219 transitions. [2018-10-10 14:42:53,298 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 219 transitions. Word has length 115 [2018-10-10 14:42:53,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:53,298 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 219 transitions. [2018-10-10 14:42:53,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 14:42:53,299 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 219 transitions. [2018-10-10 14:42:53,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-10 14:42:53,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:53,300 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, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:53,300 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:53,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:53,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1814151930, now seen corresponding path program 1 times [2018-10-10 14:42:53,301 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:53,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:53,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:53,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:53,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:53,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:53,916 WARN L178 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 10 [2018-10-10 14:42:54,198 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 20 DAG size of output: 10 [2018-10-10 14:42:54,496 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 12 [2018-10-10 14:42:54,713 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:42:54,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:54,714 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 14:42:54,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 14:42:54,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 14:42:54,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:42:54,715 INFO L87 Difference]: Start difference. First operand 212 states and 219 transitions. Second operand 16 states. [2018-10-10 14:42:55,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:55,630 INFO L93 Difference]: Finished difference Result 211 states and 218 transitions. [2018-10-10 14:42:55,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:42:55,630 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 115 [2018-10-10 14:42:55,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:55,632 INFO L225 Difference]: With dead ends: 211 [2018-10-10 14:42:55,632 INFO L226 Difference]: Without dead ends: 189 [2018-10-10 14:42:55,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 163 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=148, Invalid=974, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 14:42:55,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-10 14:42:55,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-10-10 14:42:55,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-10 14:42:55,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 193 transitions. [2018-10-10 14:42:55,636 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 193 transitions. Word has length 115 [2018-10-10 14:42:55,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:55,637 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 193 transitions. [2018-10-10 14:42:55,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 14:42:55,637 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 193 transitions. [2018-10-10 14:42:55,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-10 14:42:55,638 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:55,638 INFO L375 BasicCegarLoop]: trace histogram [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, 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:42:55,639 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:42:55,639 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:55,639 INFO L82 PathProgramCache]: Analyzing trace with hash 101783860, now seen corresponding path program 1 times [2018-10-10 14:42:55,639 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:55,639 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:55,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:55,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:55,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:55,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:56,580 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:56,581 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:56,581 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:42:56,588 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:56,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:56,643 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:56,693 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:42:56,694 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:56,706 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:56,706 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-10-10 14:42:56,713 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:42:56,713 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:56,723 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:42:56,724 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-10-10 14:42:56,787 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:56,788 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:42:56,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:42:56,789 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:56,797 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:56,797 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-10-10 14:42:56,841 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-10-10 14:42:56,842 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:56,852 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:56,853 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:14 [2018-10-10 14:42:57,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:57,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:57,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 39 [2018-10-10 14:42:57,828 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_13.bpl [2018-10-10 14:42:57,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 14:42:57,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 14:42:57,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1460, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 14:42:57,830 INFO L87 Difference]: Start difference. First operand 189 states and 193 transitions. Second operand 40 states. [2018-10-10 14:42:59,418 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2018-10-10 14:42:59,647 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2018-10-10 14:42:59,900 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2018-10-10 14:43:00,919 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2018-10-10 14:43:01,122 WARN L178 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-10-10 14:43:01,325 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2018-10-10 14:43:01,503 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2018-10-10 14:43:01,855 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-10-10 14:43:02,191 WARN L178 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-10-10 14:43:02,406 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 75 DAG size of output: 60 [2018-10-10 14:43:02,629 WARN L178 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2018-10-10 14:43:02,903 WARN L178 SmtUtils]: Spent 194.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 68 [2018-10-10 14:43:03,242 WARN L178 SmtUtils]: Spent 164.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 64 [2018-10-10 14:43:03,462 WARN L178 SmtUtils]: Spent 159.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2018-10-10 14:43:03,667 WARN L178 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 64 [2018-10-10 14:43:03,934 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 66 [2018-10-10 14:43:04,152 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 63 [2018-10-10 14:43:04,403 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2018-10-10 14:43:04,643 WARN L178 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 72 [2018-10-10 14:43:04,872 WARN L178 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 60 [2018-10-10 14:43:05,077 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 54 [2018-10-10 14:43:05,242 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2018-10-10 14:43:05,559 WARN L178 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 55 [2018-10-10 14:43:05,804 WARN L178 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2018-10-10 14:43:05,946 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 53 [2018-10-10 14:43:06,125 WARN L178 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 60 [2018-10-10 14:43:06,327 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 62 [2018-10-10 14:43:06,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:06,332 INFO L93 Difference]: Finished difference Result 241 states and 245 transitions. [2018-10-10 14:43:06,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 14:43:06,338 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 121 [2018-10-10 14:43:06,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:06,339 INFO L225 Difference]: With dead ends: 241 [2018-10-10 14:43:06,339 INFO L226 Difference]: Without dead ends: 174 [2018-10-10 14:43:06,341 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 106 SyntacticMatches, 5 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1392 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=799, Invalid=6173, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 14:43:06,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-10 14:43:06,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 174. [2018-10-10 14:43:06,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-10 14:43:06,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 177 transitions. [2018-10-10 14:43:06,347 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 177 transitions. Word has length 121 [2018-10-10 14:43:06,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:06,348 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 177 transitions. [2018-10-10 14:43:06,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 14:43:06,348 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 177 transitions. [2018-10-10 14:43:06,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-10 14:43:06,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:06,350 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:43:06,350 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:43:06,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:06,350 INFO L82 PathProgramCache]: Analyzing trace with hash 734066068, now seen corresponding path program 1 times [2018-10-10 14:43:06,351 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:06,351 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:06,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:06,352 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:06,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:07,546 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:43:07,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:07,546 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:43:07,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:07,608 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:07,654 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:43:07,654 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:07,749 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:07,749 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2018-10-10 14:43:07,757 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:43:07,758 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:07,771 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:43:07,772 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:19 [2018-10-10 14:43:07,787 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:07,787 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:07,788 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:43:07,788 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:07,796 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:07,796 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:24, output treesize:18 [2018-10-10 14:43:07,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 20 [2018-10-10 14:43:07,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:07,814 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:07,814 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:14 [2018-10-10 14:43:08,559 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:43:08,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:08,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26] total 39 [2018-10-10 14:43:08,597 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrncpy-alloca_true-valid-memsafety_true-termination.i_14.bpl [2018-10-10 14:43:08,598 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 14:43:08,599 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 14:43:08,599 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=1460, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 14:43:08,600 INFO L87 Difference]: Start difference. First operand 174 states and 177 transitions. Second operand 40 states. [2018-10-10 14:43:10,032 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2018-10-10 14:43:10,268 WARN L178 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2018-10-10 14:43:10,501 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 48 [2018-10-10 14:43:11,180 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 57 [2018-10-10 14:43:11,391 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-10-10 14:43:11,595 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 53 [2018-10-10 14:43:11,811 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 57 [2018-10-10 14:43:12,243 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-10-10 14:43:12,389 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 54 [2018-10-10 14:43:12,610 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 63 [2018-10-10 14:43:12,935 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 52 [2018-10-10 14:43:13,125 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2018-10-10 14:43:13,611 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 59 [2018-10-10 14:43:13,850 WARN L178 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2018-10-10 14:43:14,077 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2018-10-10 14:43:14,247 WARN L178 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 56 [2018-10-10 14:43:14,536 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 49 [2018-10-10 14:43:14,819 WARN L178 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-10-10 14:43:15,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:43:15,069 INFO L93 Difference]: Finished difference Result 244 states and 248 transitions. [2018-10-10 14:43:15,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 14:43:15,070 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 136 [2018-10-10 14:43:15,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:43:15,071 INFO L225 Difference]: With dead ends: 244 [2018-10-10 14:43:15,071 INFO L226 Difference]: Without dead ends: 244 [2018-10-10 14:43:15,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 124 SyntacticMatches, 6 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1419 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=764, Invalid=6208, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 14:43:15,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-10 14:43:15,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 186. [2018-10-10 14:43:15,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-10 14:43:15,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 189 transitions. [2018-10-10 14:43:15,078 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 189 transitions. Word has length 136 [2018-10-10 14:43:15,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:43:15,078 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 189 transitions. [2018-10-10 14:43:15,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 14:43:15,078 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 189 transitions. [2018-10-10 14:43:15,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-10 14:43:15,079 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:43:15,079 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-10 14:43:15,080 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK]=== [2018-10-10 14:43:15,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:43:15,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1812108300, now seen corresponding path program 2 times [2018-10-10 14:43:15,081 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:43:15,081 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:43:15,081 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:15,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:43:15,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:43:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:43:16,082 WARN L178 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 23 [2018-10-10 14:43:16,786 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:16,786 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:43:16,786 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:43:16,794 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:43:16,855 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:43:16,855 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:43:16,861 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:43:16,866 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:43:16,867 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:16,869 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:16,869 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:6, output treesize:5 [2018-10-10 14:43:16,908 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:16,909 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:43:16,910 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:43:16,910 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:16,936 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:16,937 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:17, output treesize:11 [2018-10-10 14:43:16,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:43:16,958 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:16,967 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:43:16,968 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:20, output treesize:18 [2018-10-10 14:43:17,083 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 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:43:17,086 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:43:17,087 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:17,088 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:17,099 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:43:17,099 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:33 [2018-10-10 14:43:18,110 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-10-10 14:43:18,113 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:43:18,113 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:43:18,119 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:43:18,132 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:43:18,133 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 5 variables, input treesize:40, output treesize:25 [2018-10-10 14:43:18,570 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:43:18,579 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 8 [2018-10-10 14:43:18,580 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:43:18,584 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:43:18,600 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:43:18,601 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:29 [2018-10-10 14:43:18,904 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:43:18,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:43:18,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 33] total 55 [2018-10-10 14:43:18,927 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:43:18,931 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:43:18,932 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:43:18 BoogieIcfgContainer [2018-10-10 14:43:18,932 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:43:18,933 INFO L168 Benchmark]: Toolchain (without parser) took 54836.36 ms. Allocated memory was 1.5 GB in the beginning and 2.7 GB in the end (delta: 1.2 GB). Free memory was 1.4 GB in the beginning and 2.3 GB in the end (delta: -902.7 MB). Peak memory consumption was 289.0 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:18,934 INFO L168 Benchmark]: CDTParser took 0.20 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:43:18,934 INFO L168 Benchmark]: CACSL2BoogieTranslator took 443.60 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:43:18,935 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.58 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:43:18,935 INFO L168 Benchmark]: Boogie Preprocessor took 31.49 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:43:18,935 INFO L168 Benchmark]: RCFGBuilder took 987.14 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.6 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:18,936 INFO L168 Benchmark]: TraceAbstraction took 53311.76 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 442.5 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -157.2 MB). Peak memory consumption was 285.3 MB. Max. memory is 7.1 GB. [2018-10-10 14:43:18,939 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.20 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 443.60 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 57.58 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 31.49 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 987.14 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 749.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -766.6 MB). Peak memory consumption was 16.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 53311.76 ms. Allocated memory was 2.3 GB in the beginning and 2.7 GB in the end (delta: 442.5 MB). Free memory was 2.2 GB in the beginning and 2.3 GB in the end (delta: -157.2 MB). Peak memory consumption was 285.3 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 15). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 15). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 15). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 15). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 15). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 15). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 15). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 15). - TimeoutResultAtElement [Line: 556]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 556). Cancelled while PathProgramDumpController was trying to verify (iteration 15). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 154 locations, 9 error locations. TIMEOUT Result, 53.2s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 34.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1887 SDtfs, 15938 SDslu, 18822 SDs, 0 SdLazy, 9340 SolverSat, 351 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 9.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 954 GetRequests, 428 SyntacticMatches, 12 SemanticMatches, 514 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5226 ImplicationChecksByTransitivity, 34.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=11, 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, 14 MinimizatonAttempts, 591 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 13.5s InterpolantComputationTime, 1749 NumberOfCodeBlocks, 1749 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 1731 ConstructedInterpolants, 16 QuantifiedInterpolants, 2071877 SizeOfPredicates, 143 NumberOfNonLiveVariables, 1002 ConjunctsInSsa, 269 ConjunctsInUnsatCore, 18 InterpolantComputations, 10 PerfectInterpolantSequences, 0/134 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...