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_cstrcat-alloca_true-valid-memsafety_true-termination.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:42:03,153 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:42:03,155 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:42:03,168 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:42:03,168 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:42:03,169 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:42:03,170 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:42:03,172 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:42:03,174 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:42:03,175 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:42:03,176 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:42:03,176 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:42:03,177 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:42:03,178 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:42:03,179 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:42:03,180 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:42:03,181 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:42:03,183 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:42:03,185 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:42:03,187 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:42:03,188 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:42:03,190 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:42:03,192 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:42:03,193 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:42:03,193 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:42:03,194 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:42:03,195 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:42:03,200 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:42:03,200 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:42:03,202 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:42:03,202 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:42:03,203 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:42:03,203 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:42:03,203 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:42:03,208 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:42:03,208 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:42:03,209 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:03,244 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:42:03,244 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:42:03,245 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:42:03,245 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:42:03,246 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:42:03,246 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:42:03,246 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:42:03,246 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:42:03,247 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:42:03,248 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:42:03,248 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:42:03,248 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:42:03,248 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:42:03,248 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:42:03,248 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:42:03,249 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:42:03,249 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:42:03,250 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:42:03,250 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:42:03,251 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:42:03,251 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:42:03,251 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:42:03,251 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:42:03,251 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:42:03,252 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:42:03,252 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:03,311 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:42:03,327 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:42:03,332 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:42:03,334 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:42:03,334 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:42:03,335 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:03,665 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc624b75/3bb5b91bdf8b4c97ab7a25cfba08154f/FLAG25a9b4805 [2018-10-10 14:42:03,950 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:42:03,951 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-memsafety/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:03,967 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc624b75/3bb5b91bdf8b4c97ab7a25cfba08154f/FLAG25a9b4805 [2018-10-10 14:42:03,984 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0fc624b75/3bb5b91bdf8b4c97ab7a25cfba08154f [2018-10-10 14:42:03,994 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:42:03,996 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:42:03,997 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:03,997 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:42:04,001 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:42:04,002 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:03" (1/1) ... [2018-10-10 14:42:04,005 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55969f03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:04, skipping insertion in model container [2018-10-10 14:42:04,005 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:42:03" (1/1) ... [2018-10-10 14:42:04,015 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:42:04,063 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:42:04,373 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:04,391 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:42:04,474 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:42:04,538 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:42:04,539 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:04 WrapperNode [2018-10-10 14:42:04,539 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:42:04,540 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:04,540 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:42:04,540 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:42:04,551 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:04" (1/1) ... [2018-10-10 14:42:04,576 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:04" (1/1) ... [2018-10-10 14:42:04,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:42:04,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:42:04,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:42:04,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:42:04,624 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:04" (1/1) ... [2018-10-10 14:42:04,625 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:04" (1/1) ... [2018-10-10 14:42:04,634 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:04" (1/1) ... [2018-10-10 14:42:04,639 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:04" (1/1) ... [2018-10-10 14:42:04,658 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:04" (1/1) ... [2018-10-10 14:42:04,666 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:04" (1/1) ... [2018-10-10 14:42:04,669 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:04" (1/1) ... [2018-10-10 14:42:04,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:42:04,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:42:04,754 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:42:04,755 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:42:04,756 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:04" (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:04,813 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:42:04,813 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:42:05,769 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:42:05,770 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:05 BoogieIcfgContainer [2018-10-10 14:42:05,770 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:42:05,771 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:42:05,772 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:42:05,775 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:42:05,775 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:42:03" (1/3) ... [2018-10-10 14:42:05,776 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@daf3d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:05, skipping insertion in model container [2018-10-10 14:42:05,776 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:42:04" (2/3) ... [2018-10-10 14:42:05,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@daf3d52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:42:05, skipping insertion in model container [2018-10-10 14:42:05,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:42:05" (3/3) ... [2018-10-10 14:42:05,779 INFO L112 eAbstractionObserver]: Analyzing ICFG openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i [2018-10-10 14:42:05,789 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:42:05,798 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 11 error locations. [2018-10-10 14:42:05,816 INFO L257 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2018-10-10 14:42:05,844 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:42:05,845 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:42:05,845 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:42:05,845 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:42:05,845 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:42:05,846 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:42:05,846 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:42:05,846 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:42:05,846 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:42:05,869 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states. [2018-10-10 14:42:05,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-10 14:42:05,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:05,879 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:05,881 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:05,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:05,888 INFO L82 PathProgramCache]: Analyzing trace with hash 2021757871, now seen corresponding path program 1 times [2018-10-10 14:42:05,891 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:05,892 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:05,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:05,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:05,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:05,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:06,066 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:06,069 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:06,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-10-10 14:42:06,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:42:06,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:42:06,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:42:06,091 INFO L87 Difference]: Start difference. First operand 163 states. Second operand 3 states. [2018-10-10 14:42:06,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:06,295 INFO L93 Difference]: Finished difference Result 164 states and 169 transitions. [2018-10-10 14:42:06,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:42:06,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2018-10-10 14:42:06,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:06,311 INFO L225 Difference]: With dead ends: 164 [2018-10-10 14:42:06,311 INFO L226 Difference]: Without dead ends: 157 [2018-10-10 14:42:06,313 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:42:06,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-10 14:42:06,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-10-10 14:42:06,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-10 14:42:06,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2018-10-10 14:42:06,363 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 23 [2018-10-10 14:42:06,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:06,364 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2018-10-10 14:42:06,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:42:06,364 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2018-10-10 14:42:06,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-10 14:42:06,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:06,366 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:06,366 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:06,367 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:06,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1217943548, now seen corresponding path program 1 times [2018-10-10 14:42:06,367 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:06,367 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:06,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:06,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:06,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:06,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:06,699 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:06,699 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:06,699 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:42:06,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:42:06,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:42:06,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:42:06,704 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 8 states. [2018-10-10 14:42:07,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:07,519 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2018-10-10 14:42:07,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:42:07,520 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 51 [2018-10-10 14:42:07,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:07,522 INFO L225 Difference]: With dead ends: 156 [2018-10-10 14:42:07,523 INFO L226 Difference]: Without dead ends: 156 [2018-10-10 14:42:07,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=127, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:07,524 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-10 14:42:07,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-10-10 14:42:07,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-10 14:42:07,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 160 transitions. [2018-10-10 14:42:07,548 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 160 transitions. Word has length 51 [2018-10-10 14:42:07,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:07,548 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 160 transitions. [2018-10-10 14:42:07,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:42:07,549 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2018-10-10 14:42:07,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-10 14:42:07,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:07,551 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:07,552 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:07,553 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:07,554 INFO L82 PathProgramCache]: Analyzing trace with hash 898455783, now seen corresponding path program 1 times [2018-10-10 14:42:07,554 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:07,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:07,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:07,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:07,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:08,006 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:08,006 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:08,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:42:08,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:42:08,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:42:08,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:08,008 INFO L87 Difference]: Start difference. First operand 156 states and 160 transitions. Second operand 13 states. [2018-10-10 14:42:08,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:08,929 INFO L93 Difference]: Finished difference Result 155 states and 159 transitions. [2018-10-10 14:42:08,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:42:08,930 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-10-10 14:42:08,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:08,933 INFO L225 Difference]: With dead ends: 155 [2018-10-10 14:42:08,933 INFO L226 Difference]: Without dead ends: 155 [2018-10-10 14:42:08,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=117, Invalid=345, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:42:08,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-10 14:42:08,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-10-10 14:42:08,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-10 14:42:08,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 159 transitions. [2018-10-10 14:42:08,944 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 159 transitions. Word has length 52 [2018-10-10 14:42:08,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:08,945 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 159 transitions. [2018-10-10 14:42:08,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:42:08,945 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 159 transitions. [2018-10-10 14:42:08,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-10 14:42:08,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:08,947 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:08,948 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:08,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:08,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1397723670, now seen corresponding path program 1 times [2018-10-10 14:42:08,948 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:08,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:08,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:08,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:08,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:09,051 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:09,052 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:09,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:42:09,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:42:09,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:42:09,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:42:09,053 INFO L87 Difference]: Start difference. First operand 155 states and 159 transitions. Second operand 6 states. [2018-10-10 14:42:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:09,370 INFO L93 Difference]: Finished difference Result 154 states and 158 transitions. [2018-10-10 14:42:09,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:42:09,371 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 61 [2018-10-10 14:42:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:09,373 INFO L225 Difference]: With dead ends: 154 [2018-10-10 14:42:09,373 INFO L226 Difference]: Without dead ends: 154 [2018-10-10 14:42:09,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:09,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-10 14:42:09,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2018-10-10 14:42:09,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-10 14:42:09,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2018-10-10 14:42:09,385 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 61 [2018-10-10 14:42:09,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:09,386 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2018-10-10 14:42:09,386 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:42:09,386 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2018-10-10 14:42:09,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-10 14:42:09,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:09,388 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:09,389 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:09,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:09,389 INFO L82 PathProgramCache]: Analyzing trace with hash -379760691, now seen corresponding path program 1 times [2018-10-10 14:42:09,389 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:09,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:09,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:09,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:09,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:09,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:09,796 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:09,796 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:09,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:42:09,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:42:09,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:42:09,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:42:09,798 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand 11 states. [2018-10-10 14:42:10,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:10,534 INFO L93 Difference]: Finished difference Result 173 states and 177 transitions. [2018-10-10 14:42:10,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:42:10,535 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 62 [2018-10-10 14:42:10,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:10,537 INFO L225 Difference]: With dead ends: 173 [2018-10-10 14:42:10,537 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 14:42:10,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=113, Invalid=229, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:42:10,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 14:42:10,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 153. [2018-10-10 14:42:10,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-10 14:42:10,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 157 transitions. [2018-10-10 14:42:10,551 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 157 transitions. Word has length 62 [2018-10-10 14:42:10,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:10,552 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 157 transitions. [2018-10-10 14:42:10,552 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:42:10,552 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 157 transitions. [2018-10-10 14:42:10,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-10 14:42:10,554 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:10,554 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:10,555 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:10,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:10,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1168677226, now seen corresponding path program 1 times [2018-10-10 14:42:10,555 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:10,556 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:10,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:10,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:10,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:10,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:10,671 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:10,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:10,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:42:10,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:42:10,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:42:10,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:42:10,673 INFO L87 Difference]: Start difference. First operand 153 states and 157 transitions. Second operand 8 states. [2018-10-10 14:42:11,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:11,213 INFO L93 Difference]: Finished difference Result 158 states and 162 transitions. [2018-10-10 14:42:11,216 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:42:11,216 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 78 [2018-10-10 14:42:11,217 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:11,217 INFO L225 Difference]: With dead ends: 158 [2018-10-10 14:42:11,218 INFO L226 Difference]: Without dead ends: 158 [2018-10-10 14:42:11,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:11,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-10 14:42:11,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 152. [2018-10-10 14:42:11,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-10 14:42:11,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2018-10-10 14:42:11,224 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 78 [2018-10-10 14:42:11,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:11,225 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2018-10-10 14:42:11,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:42:11,225 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2018-10-10 14:42:11,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-10 14:42:11,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:11,227 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:11,227 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:11,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:11,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1869255497, now seen corresponding path program 1 times [2018-10-10 14:42:11,228 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:11,228 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:11,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:11,229 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:11,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:11,446 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:11,447 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:11,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2018-10-10 14:42:11,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 14:42:11,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 14:42:11,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:42:11,448 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand 11 states. [2018-10-10 14:42:11,959 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 36 [2018-10-10 14:42:12,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:12,158 INFO L93 Difference]: Finished difference Result 179 states and 184 transitions. [2018-10-10 14:42:12,158 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 14:42:12,158 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 79 [2018-10-10 14:42:12,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:12,160 INFO L225 Difference]: With dead ends: 179 [2018-10-10 14:42:12,160 INFO L226 Difference]: Without dead ends: 179 [2018-10-10 14:42:12,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=140, Invalid=280, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:42:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-10 14:42:12,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 157. [2018-10-10 14:42:12,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-10 14:42:12,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 161 transitions. [2018-10-10 14:42:12,167 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 161 transitions. Word has length 79 [2018-10-10 14:42:12,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:12,168 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 161 transitions. [2018-10-10 14:42:12,168 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 14:42:12,168 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 161 transitions. [2018-10-10 14:42:12,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 14:42:12,170 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:12,170 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:12,171 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:12,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash 154707873, now seen corresponding path program 1 times [2018-10-10 14:42:12,171 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:12,172 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:12,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:12,173 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:12,173 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:12,320 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:12,320 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:12,320 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:12,321 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:12,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:12,321 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:12,322 INFO L87 Difference]: Start difference. First operand 157 states and 161 transitions. Second operand 9 states. [2018-10-10 14:42:12,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:12,557 INFO L93 Difference]: Finished difference Result 156 states and 160 transitions. [2018-10-10 14:42:12,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:42:12,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 95 [2018-10-10 14:42:12,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:12,560 INFO L225 Difference]: With dead ends: 156 [2018-10-10 14:42:12,560 INFO L226 Difference]: Without dead ends: 156 [2018-10-10 14:42:12,561 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:42:12,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-10 14:42:12,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2018-10-10 14:42:12,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-10 14:42:12,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 160 transitions. [2018-10-10 14:42:12,565 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 160 transitions. Word has length 95 [2018-10-10 14:42:12,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:12,566 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 160 transitions. [2018-10-10 14:42:12,566 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:12,566 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2018-10-10 14:42:12,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 14:42:12,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:12,568 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:12,568 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:12,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:12,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1988404840, now seen corresponding path program 1 times [2018-10-10 14:42:12,569 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:12,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:12,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:12,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:12,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:12,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:12,863 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:12,863 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:12,863 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:12,874 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:12,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:12,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:12,976 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:12,978 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:12,995 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:12,995 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:42:13,180 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:42:13,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:13,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 13 [2018-10-10 14:42:13,255 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/openbsd_cstrcat-alloca_true-valid-memsafety_true-termination.i_9.bpl [2018-10-10 14:42:13,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 14:42:13,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 14:42:13,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:42:13,260 INFO L87 Difference]: Start difference. First operand 156 states and 160 transitions. Second operand 14 states. [2018-10-10 14:42:14,025 WARN L178 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 41 [2018-10-10 14:42:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:14,590 INFO L93 Difference]: Finished difference Result 198 states and 204 transitions. [2018-10-10 14:42:14,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:42:14,590 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 95 [2018-10-10 14:42:14,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:14,592 INFO L225 Difference]: With dead ends: 198 [2018-10-10 14:42:14,593 INFO L226 Difference]: Without dead ends: 198 [2018-10-10 14:42:14,593 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 90 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-10 14:42:14,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-10 14:42:14,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 172. [2018-10-10 14:42:14,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-10 14:42:14,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 177 transitions. [2018-10-10 14:42:14,598 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 177 transitions. Word has length 95 [2018-10-10 14:42:14,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:14,599 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 177 transitions. [2018-10-10 14:42:14,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 14:42:14,599 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 177 transitions. [2018-10-10 14:42:14,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-10 14:42:14,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:14,600 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:14,601 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:14,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:14,601 INFO L82 PathProgramCache]: Analyzing trace with hash 500976942, now seen corresponding path program 1 times [2018-10-10 14:42:14,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:14,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:14,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:14,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:14,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:14,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:15,992 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:15,993 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:15,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-10 14:42:15,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 14:42:15,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 14:42:15,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:42:15,994 INFO L87 Difference]: Start difference. First operand 172 states and 177 transitions. Second operand 17 states. [2018-10-10 14:42:17,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:17,262 INFO L93 Difference]: Finished difference Result 234 states and 239 transitions. [2018-10-10 14:42:17,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 14:42:17,263 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 96 [2018-10-10 14:42:17,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:17,265 INFO L225 Difference]: With dead ends: 234 [2018-10-10 14:42:17,265 INFO L226 Difference]: Without dead ends: 234 [2018-10-10 14:42:17,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 258 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=298, Invalid=1262, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 14:42:17,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-10 14:42:17,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 181. [2018-10-10 14:42:17,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-10 14:42:17,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 186 transitions. [2018-10-10 14:42:17,271 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 186 transitions. Word has length 96 [2018-10-10 14:42:17,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:17,271 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 186 transitions. [2018-10-10 14:42:17,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 14:42:17,271 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 186 transitions. [2018-10-10 14:42:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-10 14:42:17,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:17,273 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:17,273 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:17,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:17,274 INFO L82 PathProgramCache]: Analyzing trace with hash -259538508, now seen corresponding path program 1 times [2018-10-10 14:42:17,274 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:17,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:17,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:17,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:17,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:17,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:17,430 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:17,431 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:17,431 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:42:17,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:42:17,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:42:17,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:42:17,432 INFO L87 Difference]: Start difference. First operand 181 states and 186 transitions. Second operand 9 states. [2018-10-10 14:42:17,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:17,740 INFO L93 Difference]: Finished difference Result 180 states and 185 transitions. [2018-10-10 14:42:17,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:42:17,740 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 106 [2018-10-10 14:42:17,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:17,742 INFO L225 Difference]: With dead ends: 180 [2018-10-10 14:42:17,742 INFO L226 Difference]: Without dead ends: 180 [2018-10-10 14:42:17,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:42:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-10 14:42:17,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2018-10-10 14:42:17,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-10 14:42:17,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 185 transitions. [2018-10-10 14:42:17,748 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 185 transitions. Word has length 106 [2018-10-10 14:42:17,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:17,748 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 185 transitions. [2018-10-10 14:42:17,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:42:17,748 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 185 transitions. [2018-10-10 14:42:17,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-10 14:42:17,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:17,749 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:17,750 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:17,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:17,750 INFO L82 PathProgramCache]: Analyzing trace with hash 544241032, now seen corresponding path program 1 times [2018-10-10 14:42:17,750 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:17,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:17,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:17,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:17,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:18,174 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:18,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:42:18,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:42:18,175 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:42:18,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:42:18,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:42:18,176 INFO L87 Difference]: Start difference. First operand 180 states and 185 transitions. Second operand 12 states. [2018-10-10 14:42:18,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:42:18,737 INFO L93 Difference]: Finished difference Result 253 states and 258 transitions. [2018-10-10 14:42:18,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:42:18,737 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 107 [2018-10-10 14:42:18,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:42:18,739 INFO L225 Difference]: With dead ends: 253 [2018-10-10 14:42:18,739 INFO L226 Difference]: Without dead ends: 253 [2018-10-10 14:42:18,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=194, Invalid=406, Unknown=0, NotChecked=0, Total=600 [2018-10-10 14:42:18,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-10 14:42:18,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 201. [2018-10-10 14:42:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-10 14:42:18,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 206 transitions. [2018-10-10 14:42:18,744 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 206 transitions. Word has length 107 [2018-10-10 14:42:18,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:42:18,745 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 206 transitions. [2018-10-10 14:42:18,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:42:18,745 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 206 transitions. [2018-10-10 14:42:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-10 14:42:18,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:42:18,746 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:42:18,746 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:42:18,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:42:18,747 INFO L82 PathProgramCache]: Analyzing trace with hash 911498777, now seen corresponding path program 2 times [2018-10-10 14:42:18,747 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:42:18,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:42:18,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:18,748 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:42:18,748 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:42:18,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:42:19,370 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:42:19,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:42:19,371 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:19,378 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:42:19,426 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:42:19,427 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:42:19,439 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:42:19,469 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:19,470 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,481 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:19,481 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:15, output treesize:11 [2018-10-10 14:42:19,725 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 8 [2018-10-10 14:42:19,727 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:42:19,727 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,731 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:42:19,742 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:42:19,742 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:27, output treesize:23 [2018-10-10 14:42:20,308 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:42:20,321 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 12 [2018-10-10 14:42:20,322 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-10-10 14:42:20,335 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-10 14:42:20,347 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:20,347 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:28, output treesize:40 [2018-10-10 14:42:20,713 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:42:20,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:42:20,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 31 [2018-10-10 14:42:20,736 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:42:20,741 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:42:20,741 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:42:20 BoogieIcfgContainer [2018-10-10 14:42:20,741 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:42:20,742 INFO L168 Benchmark]: Toolchain (without parser) took 16747.08 ms. Allocated memory was 1.5 GB in the beginning and 2.6 GB in the end (delta: 1.0 GB). Free memory was 1.4 GB in the beginning and 2.5 GB in the end (delta: -1.1 GB). Peak memory consumption was 713.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:20,743 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:42:20,743 INFO L168 Benchmark]: CACSL2BoogieTranslator took 542.83 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: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:20,744 INFO L168 Benchmark]: Boogie Procedure Inliner took 72.56 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:42:20,745 INFO L168 Benchmark]: Boogie Preprocessor took 138.61 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -821.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:20,746 INFO L168 Benchmark]: RCFGBuilder took 1016.28 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 53.5 MB). Peak memory consumption was 53.5 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:20,747 INFO L168 Benchmark]: TraceAbstraction took 14969.72 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 277.9 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -314.5 MB). Peak memory consumption was 719.9 MB. Max. memory is 7.1 GB. [2018-10-10 14:42:20,751 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 542.83 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: 23.8 MB). Peak memory consumption was 23.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 72.56 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 138.61 ms. Allocated memory was 1.5 GB in the beginning and 2.3 GB in the end (delta: 738.2 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -821.7 MB). Peak memory consumption was 16.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1016.28 ms. Allocated memory is still 2.3 GB. Free memory was 2.2 GB in the beginning and 2.2 GB in the end (delta: 53.5 MB). Peak memory consumption was 53.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 14969.72 ms. Allocated memory was 2.3 GB in the beginning and 2.6 GB in the end (delta: 277.9 MB). Free memory was 2.2 GB in the beginning and 2.5 GB in the end (delta: -314.5 MB). Peak memory consumption was 719.9 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 13). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: 548]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 548). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 13). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 163 locations, 11 error locations. TIMEOUT Result, 14.9s OverallTime, 13 OverallIterations, 3 TraceHistogramMax, 8.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1565 SDtfs, 7735 SDslu, 5252 SDs, 0 SdLazy, 2487 SolverSat, 106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 305 GetRequests, 105 SyntacticMatches, 4 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 452 ImplicationChecksByTransitivity, 6.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=201occurred in iteration=12, 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, 12 MinimizatonAttempts, 179 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.0s InterpolantComputationTime, 1000 NumberOfCodeBlocks, 1000 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 987 ConstructedInterpolants, 0 QuantifiedInterpolants, 434937 SizeOfPredicates, 13 NumberOfNonLiveVariables, 188 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 13 InterpolantComputations, 11 PerfectInterpolantSequences, 0/10 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...