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/memsafety-ext2/optional_data_creation_test04_true-valid-memsafety.i -------------------------------------------------------------------------------- This is Ultimate 0.1.23-c5b1954-m [2018-10-10 14:50:18,357 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 14:50:18,360 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 14:50:18,375 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 14:50:18,376 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 14:50:18,377 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 14:50:18,378 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 14:50:18,379 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 14:50:18,381 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 14:50:18,382 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 14:50:18,383 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 14:50:18,383 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 14:50:18,384 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 14:50:18,385 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 14:50:18,386 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 14:50:18,387 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 14:50:18,388 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 14:50:18,390 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 14:50:18,392 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 14:50:18,393 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 14:50:18,394 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 14:50:18,395 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 14:50:18,398 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 14:50:18,398 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 14:50:18,398 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 14:50:18,399 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 14:50:18,400 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 14:50:18,401 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 14:50:18,402 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 14:50:18,403 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 14:50:18,403 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 14:50:18,404 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 14:50:18,404 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 14:50:18,404 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 14:50:18,405 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 14:50:18,406 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 14:50:18,406 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:50:18,434 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 14:50:18,434 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 14:50:18,438 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-10 14:50:18,439 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-10 14:50:18,439 INFO L133 SettingsManager]: * Use SBE=true [2018-10-10 14:50:18,439 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-10 14:50:18,439 INFO L133 SettingsManager]: * sizeof long=4 [2018-10-10 14:50:18,440 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-10 14:50:18,441 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-10 14:50:18,441 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-10-10 14:50:18,441 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-10 14:50:18,441 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2018-10-10 14:50:18,442 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2018-10-10 14:50:18,442 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2018-10-10 14:50:18,442 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-10-10 14:50:18,442 INFO L133 SettingsManager]: * sizeof long double=12 [2018-10-10 14:50:18,442 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 14:50:18,443 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-10 14:50:18,443 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-10-10 14:50:18,443 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-10-10 14:50:18,443 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-10-10 14:50:18,443 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 14:50:18,443 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-10-10 14:50:18,444 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-10 14:50:18,444 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-10-10 14:50:18,444 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:50:18,520 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 14:50:18,533 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 14:50:18,536 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 14:50:18,538 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-10 14:50:18,538 INFO L276 PluginConnector]: CDTParser initialized [2018-10-10 14:50:18,539 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_true-valid-memsafety.i [2018-10-10 14:50:18,834 INFO L217 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b17e7f1/e21e8b51600b4a1ca891af412140dd08/FLAGe577d155c [2018-10-10 14:50:19,153 INFO L289 CDTParser]: Found 1 translation units. [2018-10-10 14:50:19,154 INFO L157 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/memsafety-ext2/optional_data_creation_test04_true-valid-memsafety.i [2018-10-10 14:50:19,176 INFO L337 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b17e7f1/e21e8b51600b4a1ca891af412140dd08/FLAGe577d155c [2018-10-10 14:50:19,194 INFO L345 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/29b17e7f1/e21e8b51600b4a1ca891af412140dd08 [2018-10-10 14:50:19,207 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 14:50:19,211 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2018-10-10 14:50:19,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-10 14:50:19,213 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-10 14:50:19,217 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-10 14:50:19,218 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:50:19" (1/1) ... [2018-10-10 14:50:19,221 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@8b74a76 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:50:19, skipping insertion in model container [2018-10-10 14:50:19,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.10 02:50:19" (1/1) ... [2018-10-10 14:50:19,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-10 14:50:19,298 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-10 14:50:19,591 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:50:19,601 INFO L189 MainTranslator]: Completed pre-run [2018-10-10 14:50:19,666 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-10 14:50:19,722 INFO L193 MainTranslator]: Completed translation [2018-10-10 14:50:19,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:50:19 WrapperNode [2018-10-10 14:50:19,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-10 14:50:19,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-10 14:50:19,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-10 14:50:19,723 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-10 14:50:19,733 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:50:19" (1/1) ... [2018-10-10 14:50:19,750 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:50:19" (1/1) ... [2018-10-10 14:50:19,801 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-10 14:50:19,802 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 14:50:19,802 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 14:50:19,802 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 14:50:19,889 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:50:19" (1/1) ... [2018-10-10 14:50:19,889 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:50:19" (1/1) ... [2018-10-10 14:50:19,899 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:50:19" (1/1) ... [2018-10-10 14:50:19,899 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:50:19" (1/1) ... [2018-10-10 14:50:19,920 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:50:19" (1/1) ... [2018-10-10 14:50:19,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:50:19" (1/1) ... [2018-10-10 14:50:19,929 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:50:19" (1/1) ... [2018-10-10 14:50:19,936 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 14:50:19,937 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 14:50:19,937 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 14:50:19,937 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 14:50:19,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:50:19" (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:50:19,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 14:50:19,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 14:50:21,671 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 14:50:21,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:50:21 BoogieIcfgContainer [2018-10-10 14:50:21,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 14:50:21,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 14:50:21,674 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 14:50:21,677 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 14:50:21,677 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.10 02:50:19" (1/3) ... [2018-10-10 14:50:21,678 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f912d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:50:21, skipping insertion in model container [2018-10-10 14:50:21,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.10 02:50:19" (2/3) ... [2018-10-10 14:50:21,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f912d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 02:50:21, skipping insertion in model container [2018-10-10 14:50:21,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 02:50:21" (3/3) ... [2018-10-10 14:50:21,681 INFO L112 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04_true-valid-memsafety.i [2018-10-10 14:50:21,691 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-10-10 14:50:21,699 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 45 error locations. [2018-10-10 14:50:21,713 INFO L257 AbstractCegarLoop]: Starting to check reachability of 45 error locations. [2018-10-10 14:50:21,739 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 14:50:21,740 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 14:50:21,740 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 14:50:21,741 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-10-10 14:50:21,741 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 14:50:21,741 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 14:50:21,741 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 14:50:21,741 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 14:50:21,741 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 14:50:21,772 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states. [2018-10-10 14:50:21,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-10 14:50:21,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:21,786 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] [2018-10-10 14:50:21,789 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:21,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:21,795 INFO L82 PathProgramCache]: Analyzing trace with hash 2071159758, now seen corresponding path program 1 times [2018-10-10 14:50:21,797 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:21,798 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:21,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:21,846 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:21,846 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:22,092 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:50:22,095 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:22,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:50:22,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:50:22,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:50:22,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:50:22,122 INFO L87 Difference]: Start difference. First operand 391 states. Second operand 5 states. [2018-10-10 14:50:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:23,358 INFO L93 Difference]: Finished difference Result 574 states and 583 transitions. [2018-10-10 14:50:23,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:50:23,359 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2018-10-10 14:50:23,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:23,379 INFO L225 Difference]: With dead ends: 574 [2018-10-10 14:50:23,379 INFO L226 Difference]: Without dead ends: 569 [2018-10-10 14:50:23,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:50:23,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-10-10 14:50:23,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 385. [2018-10-10 14:50:23,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-10-10 14:50:23,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 391 transitions. [2018-10-10 14:50:23,448 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 391 transitions. Word has length 24 [2018-10-10 14:50:23,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:23,449 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 391 transitions. [2018-10-10 14:50:23,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:50:23,449 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 391 transitions. [2018-10-10 14:50:23,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-10 14:50:23,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:23,451 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] [2018-10-10 14:50:23,452 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:23,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:23,453 INFO L82 PathProgramCache]: Analyzing trace with hash -218556885, now seen corresponding path program 1 times [2018-10-10 14:50:23,453 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:23,453 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:23,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:23,454 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:23,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:23,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:23,634 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:50:23,634 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:23,635 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:50:23,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:50:23,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:50:23,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:50:23,637 INFO L87 Difference]: Start difference. First operand 385 states and 391 transitions. Second operand 7 states. [2018-10-10 14:50:24,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:24,280 INFO L93 Difference]: Finished difference Result 394 states and 400 transitions. [2018-10-10 14:50:24,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:50:24,287 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-10-10 14:50:24,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:24,290 INFO L225 Difference]: With dead ends: 394 [2018-10-10 14:50:24,291 INFO L226 Difference]: Without dead ends: 394 [2018-10-10 14:50:24,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:50:24,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-10 14:50:24,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 384. [2018-10-10 14:50:24,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-10-10 14:50:24,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 390 transitions. [2018-10-10 14:50:24,319 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 390 transitions. Word has length 25 [2018-10-10 14:50:24,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:24,320 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 390 transitions. [2018-10-10 14:50:24,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:50:24,320 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 390 transitions. [2018-10-10 14:50:24,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-10 14:50:24,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:24,322 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:50:24,325 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:24,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:24,326 INFO L82 PathProgramCache]: Analyzing trace with hash -2011027744, now seen corresponding path program 1 times [2018-10-10 14:50:24,326 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:24,326 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:24,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:24,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:24,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:24,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:24,562 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:50:24,563 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:24,563 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:50:24,563 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:50:24,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:50:24,564 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:50:24,564 INFO L87 Difference]: Start difference. First operand 384 states and 390 transitions. Second operand 9 states. [2018-10-10 14:50:26,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:26,593 INFO L93 Difference]: Finished difference Result 1174 states and 1196 transitions. [2018-10-10 14:50:26,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 14:50:26,593 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 52 [2018-10-10 14:50:26,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:26,600 INFO L225 Difference]: With dead ends: 1174 [2018-10-10 14:50:26,601 INFO L226 Difference]: Without dead ends: 1174 [2018-10-10 14:50:26,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=283, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:50:26,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2018-10-10 14:50:26,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 405. [2018-10-10 14:50:26,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-10 14:50:26,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 411 transitions. [2018-10-10 14:50:26,618 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 411 transitions. Word has length 52 [2018-10-10 14:50:26,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:26,618 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 411 transitions. [2018-10-10 14:50:26,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:50:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 411 transitions. [2018-10-10 14:50:26,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-10 14:50:26,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:26,621 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] [2018-10-10 14:50:26,622 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:26,622 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:26,622 INFO L82 PathProgramCache]: Analyzing trace with hash 2082649466, now seen corresponding path program 1 times [2018-10-10 14:50:26,622 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:26,623 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:26,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:26,624 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:26,624 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:27,071 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:50:27,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:27,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:50:27,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:50:27,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:50:27,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:50:27,073 INFO L87 Difference]: Start difference. First operand 405 states and 411 transitions. Second operand 13 states. [2018-10-10 14:50:29,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:29,581 INFO L93 Difference]: Finished difference Result 934 states and 950 transitions. [2018-10-10 14:50:29,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 14:50:29,581 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-10-10 14:50:29,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:29,586 INFO L225 Difference]: With dead ends: 934 [2018-10-10 14:50:29,586 INFO L226 Difference]: Without dead ends: 934 [2018-10-10 14:50:29,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=194, Invalid=676, Unknown=0, NotChecked=0, Total=870 [2018-10-10 14:50:29,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 934 states. [2018-10-10 14:50:29,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 934 to 406. [2018-10-10 14:50:29,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 406 states. [2018-10-10 14:50:29,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 412 transitions. [2018-10-10 14:50:29,597 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 412 transitions. Word has length 53 [2018-10-10 14:50:29,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:29,598 INFO L481 AbstractCegarLoop]: Abstraction has 406 states and 412 transitions. [2018-10-10 14:50:29,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:50:29,598 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 412 transitions. [2018-10-10 14:50:29,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-10 14:50:29,599 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:29,599 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] [2018-10-10 14:50:29,601 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:29,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:29,601 INFO L82 PathProgramCache]: Analyzing trace with hash -794913312, now seen corresponding path program 1 times [2018-10-10 14:50:29,601 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:29,601 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:29,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:29,603 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:29,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:29,688 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:50:29,688 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:29,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:50:29,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:50:29,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:50:29,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:50:29,689 INFO L87 Difference]: Start difference. First operand 406 states and 412 transitions. Second operand 6 states. [2018-10-10 14:50:31,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:31,090 INFO L93 Difference]: Finished difference Result 757 states and 770 transitions. [2018-10-10 14:50:31,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:50:31,091 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 63 [2018-10-10 14:50:31,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:31,098 INFO L225 Difference]: With dead ends: 757 [2018-10-10 14:50:31,098 INFO L226 Difference]: Without dead ends: 757 [2018-10-10 14:50:31,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2018-10-10 14:50:31,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 757 states. [2018-10-10 14:50:31,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 757 to 411. [2018-10-10 14:50:31,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-10 14:50:31,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 417 transitions. [2018-10-10 14:50:31,111 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 417 transitions. Word has length 63 [2018-10-10 14:50:31,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:31,112 INFO L481 AbstractCegarLoop]: Abstraction has 411 states and 417 transitions. [2018-10-10 14:50:31,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:50:31,112 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 417 transitions. [2018-10-10 14:50:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-10 14:50:31,113 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:31,113 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] [2018-10-10 14:50:31,114 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:31,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:31,115 INFO L82 PathProgramCache]: Analyzing trace with hash 1127491207, now seen corresponding path program 1 times [2018-10-10 14:50:31,115 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:31,115 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:31,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:31,116 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:31,116 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:31,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:31,275 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:50:31,276 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:31,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:50:31,276 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:50:31,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:50:31,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:50:31,277 INFO L87 Difference]: Start difference. First operand 411 states and 417 transitions. Second operand 8 states. [2018-10-10 14:50:31,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:31,745 INFO L93 Difference]: Finished difference Result 607 states and 616 transitions. [2018-10-10 14:50:31,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:50:31,745 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2018-10-10 14:50:31,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:31,750 INFO L225 Difference]: With dead ends: 607 [2018-10-10 14:50:31,750 INFO L226 Difference]: Without dead ends: 607 [2018-10-10 14:50:31,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:50:31,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2018-10-10 14:50:31,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 410. [2018-10-10 14:50:31,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-10 14:50:31,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 416 transitions. [2018-10-10 14:50:31,759 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 416 transitions. Word has length 64 [2018-10-10 14:50:31,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:31,760 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 416 transitions. [2018-10-10 14:50:31,760 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:50:31,760 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 416 transitions. [2018-10-10 14:50:31,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-10 14:50:31,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:31,762 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] [2018-10-10 14:50:31,763 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:31,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:31,763 INFO L82 PathProgramCache]: Analyzing trace with hash 1391652652, now seen corresponding path program 1 times [2018-10-10 14:50:31,763 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:31,763 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:31,764 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:31,764 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:31,765 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:31,933 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:50:31,933 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:31,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:50:31,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:50:31,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:50:31,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:50:31,934 INFO L87 Difference]: Start difference. First operand 410 states and 416 transitions. Second operand 8 states. [2018-10-10 14:50:32,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:32,445 INFO L93 Difference]: Finished difference Result 606 states and 615 transitions. [2018-10-10 14:50:32,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:50:32,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 84 [2018-10-10 14:50:32,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:32,450 INFO L225 Difference]: With dead ends: 606 [2018-10-10 14:50:32,450 INFO L226 Difference]: Without dead ends: 606 [2018-10-10 14:50:32,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:50:32,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2018-10-10 14:50:32,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 411. [2018-10-10 14:50:32,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-10 14:50:32,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 417 transitions. [2018-10-10 14:50:32,459 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 417 transitions. Word has length 84 [2018-10-10 14:50:32,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:32,460 INFO L481 AbstractCegarLoop]: Abstraction has 411 states and 417 transitions. [2018-10-10 14:50:32,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:50:32,460 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 417 transitions. [2018-10-10 14:50:32,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-10 14:50:32,461 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:32,462 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] [2018-10-10 14:50:32,463 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:32,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:32,463 INFO L82 PathProgramCache]: Analyzing trace with hash 513117298, now seen corresponding path program 1 times [2018-10-10 14:50:32,464 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:32,464 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:32,464 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:32,465 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:32,465 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:32,611 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:50:32,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:32,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:50:32,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:50:32,612 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:50:32,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:50:32,612 INFO L87 Difference]: Start difference. First operand 411 states and 417 transitions. Second operand 6 states. [2018-10-10 14:50:33,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:33,091 INFO L93 Difference]: Finished difference Result 669 states and 681 transitions. [2018-10-10 14:50:33,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:50:33,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2018-10-10 14:50:33,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:33,096 INFO L225 Difference]: With dead ends: 669 [2018-10-10 14:50:33,097 INFO L226 Difference]: Without dead ends: 669 [2018-10-10 14:50:33,097 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:50:33,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2018-10-10 14:50:33,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 421. [2018-10-10 14:50:33,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-10 14:50:33,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 427 transitions. [2018-10-10 14:50:33,106 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 427 transitions. Word has length 94 [2018-10-10 14:50:33,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:33,107 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 427 transitions. [2018-10-10 14:50:33,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:50:33,107 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 427 transitions. [2018-10-10 14:50:33,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 14:50:33,108 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:33,109 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:50:33,110 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:33,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:33,110 INFO L82 PathProgramCache]: Analyzing trace with hash -1273232684, now seen corresponding path program 1 times [2018-10-10 14:50:33,110 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:33,111 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:33,111 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:33,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:33,112 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:33,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:33,283 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:50:33,284 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:33,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:50:33,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:50:33,285 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:50:33,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:50:33,285 INFO L87 Difference]: Start difference. First operand 421 states and 427 transitions. Second operand 10 states. [2018-10-10 14:50:34,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:34,725 INFO L93 Difference]: Finished difference Result 827 states and 840 transitions. [2018-10-10 14:50:34,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 14:50:34,725 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 95 [2018-10-10 14:50:34,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:34,729 INFO L225 Difference]: With dead ends: 827 [2018-10-10 14:50:34,729 INFO L226 Difference]: Without dead ends: 827 [2018-10-10 14:50:34,730 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=203, Invalid=499, Unknown=0, NotChecked=0, Total=702 [2018-10-10 14:50:34,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2018-10-10 14:50:34,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 422. [2018-10-10 14:50:34,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-10-10 14:50:34,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 428 transitions. [2018-10-10 14:50:34,739 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 428 transitions. Word has length 95 [2018-10-10 14:50:34,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:34,740 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 428 transitions. [2018-10-10 14:50:34,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:50:34,740 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 428 transitions. [2018-10-10 14:50:34,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-10 14:50:34,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:34,742 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:50:34,743 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:34,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:34,743 INFO L82 PathProgramCache]: Analyzing trace with hash -1126179176, now seen corresponding path program 1 times [2018-10-10 14:50:34,743 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:34,744 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:34,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:34,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:34,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:34,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:34,878 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:50:34,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:34,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:50:34,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:50:34,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:50:34,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:50:34,879 INFO L87 Difference]: Start difference. First operand 422 states and 428 transitions. Second operand 6 states. [2018-10-10 14:50:35,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:35,482 INFO L93 Difference]: Finished difference Result 795 states and 808 transitions. [2018-10-10 14:50:35,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:50:35,482 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2018-10-10 14:50:35,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:35,487 INFO L225 Difference]: With dead ends: 795 [2018-10-10 14:50:35,488 INFO L226 Difference]: Without dead ends: 795 [2018-10-10 14:50:35,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:50:35,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 795 states. [2018-10-10 14:50:35,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 795 to 421. [2018-10-10 14:50:35,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 421 states. [2018-10-10 14:50:35,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 421 states to 421 states and 427 transitions. [2018-10-10 14:50:35,498 INFO L78 Accepts]: Start accepts. Automaton has 421 states and 427 transitions. Word has length 96 [2018-10-10 14:50:35,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:35,499 INFO L481 AbstractCegarLoop]: Abstraction has 421 states and 427 transitions. [2018-10-10 14:50:35,499 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:50:35,499 INFO L276 IsEmpty]: Start isEmpty. Operand 421 states and 427 transitions. [2018-10-10 14:50:35,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-10 14:50:35,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:35,501 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] [2018-10-10 14:50:35,502 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:35,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:35,503 INFO L82 PathProgramCache]: Analyzing trace with hash -551815870, now seen corresponding path program 1 times [2018-10-10 14:50:35,503 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:35,503 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:35,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:35,504 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:35,504 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:35,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:35,679 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:50:35,679 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:35,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:50:35,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:50:35,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:50:35,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:50:35,681 INFO L87 Difference]: Start difference. First operand 421 states and 427 transitions. Second operand 8 states. [2018-10-10 14:50:36,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:36,482 INFO L93 Difference]: Finished difference Result 645 states and 654 transitions. [2018-10-10 14:50:36,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 14:50:36,483 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 97 [2018-10-10 14:50:36,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:36,486 INFO L225 Difference]: With dead ends: 645 [2018-10-10 14:50:36,486 INFO L226 Difference]: Without dead ends: 645 [2018-10-10 14:50:36,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:50:36,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 645 states. [2018-10-10 14:50:36,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 645 to 420. [2018-10-10 14:50:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-10-10 14:50:36,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 426 transitions. [2018-10-10 14:50:36,494 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 426 transitions. Word has length 97 [2018-10-10 14:50:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:36,494 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 426 transitions. [2018-10-10 14:50:36,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:50:36,495 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 426 transitions. [2018-10-10 14:50:36,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-10 14:50:36,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:36,496 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:50:36,497 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:36,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:36,498 INFO L82 PathProgramCache]: Analyzing trace with hash -1217946775, now seen corresponding path program 1 times [2018-10-10 14:50:36,498 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:36,498 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:36,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:36,499 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:36,499 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:36,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:36,637 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:50:36,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:36,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 14:50:36,637 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 14:50:36,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 14:50:36,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-10 14:50:36,638 INFO L87 Difference]: Start difference. First operand 420 states and 426 transitions. Second operand 5 states. [2018-10-10 14:50:36,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:36,971 INFO L93 Difference]: Finished difference Result 604 states and 615 transitions. [2018-10-10 14:50:36,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:50:36,972 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 107 [2018-10-10 14:50:36,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:36,976 INFO L225 Difference]: With dead ends: 604 [2018-10-10 14:50:36,976 INFO L226 Difference]: Without dead ends: 604 [2018-10-10 14:50:36,976 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:50:36,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-10-10 14:50:36,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 419. [2018-10-10 14:50:36,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 419 states. [2018-10-10 14:50:36,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 419 states to 419 states and 425 transitions. [2018-10-10 14:50:36,984 INFO L78 Accepts]: Start accepts. Automaton has 419 states and 425 transitions. Word has length 107 [2018-10-10 14:50:36,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:36,984 INFO L481 AbstractCegarLoop]: Abstraction has 419 states and 425 transitions. [2018-10-10 14:50:36,984 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 14:50:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 425 transitions. [2018-10-10 14:50:36,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-10 14:50:36,985 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:36,986 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:36,987 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:36,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:36,987 INFO L82 PathProgramCache]: Analyzing trace with hash 996815100, now seen corresponding path program 1 times [2018-10-10 14:50:36,987 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:36,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:36,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:36,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:36,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:37,369 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:50:37,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:37,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-10 14:50:37,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:50:37,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:50:37,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:50:37,371 INFO L87 Difference]: Start difference. First operand 419 states and 425 transitions. Second operand 7 states. [2018-10-10 14:50:37,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:37,842 INFO L93 Difference]: Finished difference Result 528 states and 537 transitions. [2018-10-10 14:50:37,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 14:50:37,843 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 108 [2018-10-10 14:50:37,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:37,846 INFO L225 Difference]: With dead ends: 528 [2018-10-10 14:50:37,846 INFO L226 Difference]: Without dead ends: 528 [2018-10-10 14:50:37,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:50:37,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-10-10 14:50:37,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 436. [2018-10-10 14:50:37,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-10-10 14:50:37,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 443 transitions. [2018-10-10 14:50:37,854 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 443 transitions. Word has length 108 [2018-10-10 14:50:37,854 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:37,854 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 443 transitions. [2018-10-10 14:50:37,854 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:50:37,855 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 443 transitions. [2018-10-10 14:50:37,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-10 14:50:37,856 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:37,856 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:50:37,857 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:37,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:37,858 INFO L82 PathProgramCache]: Analyzing trace with hash 898355871, now seen corresponding path program 1 times [2018-10-10 14:50:37,858 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:37,858 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:37,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:37,859 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:37,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:37,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:38,655 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:50:38,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:38,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:50:38,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:50:38,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:50:38,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:50:38,656 INFO L87 Difference]: Start difference. First operand 436 states and 443 transitions. Second operand 8 states. [2018-10-10 14:50:39,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:39,118 INFO L93 Difference]: Finished difference Result 663 states and 673 transitions. [2018-10-10 14:50:39,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 14:50:39,118 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2018-10-10 14:50:39,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:39,122 INFO L225 Difference]: With dead ends: 663 [2018-10-10 14:50:39,122 INFO L226 Difference]: Without dead ends: 663 [2018-10-10 14:50:39,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:50:39,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2018-10-10 14:50:39,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 442. [2018-10-10 14:50:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-10-10 14:50:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 449 transitions. [2018-10-10 14:50:39,130 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 449 transitions. Word has length 108 [2018-10-10 14:50:39,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:39,130 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 449 transitions. [2018-10-10 14:50:39,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:50:39,131 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 449 transitions. [2018-10-10 14:50:39,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-10 14:50:39,132 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:39,132 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:50:39,133 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:39,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:39,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1776812318, now seen corresponding path program 1 times [2018-10-10 14:50:39,134 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:39,134 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:39,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:39,135 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:39,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:39,725 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:50:39,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:39,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:50:39,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:50:39,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:50:39,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:50:39,726 INFO L87 Difference]: Start difference. First operand 442 states and 449 transitions. Second operand 8 states. [2018-10-10 14:50:40,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:40,767 INFO L93 Difference]: Finished difference Result 1170 states and 1189 transitions. [2018-10-10 14:50:40,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:50:40,768 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 108 [2018-10-10 14:50:40,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:40,774 INFO L225 Difference]: With dead ends: 1170 [2018-10-10 14:50:40,774 INFO L226 Difference]: Without dead ends: 1170 [2018-10-10 14:50:40,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=268, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:50:40,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2018-10-10 14:50:40,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 441. [2018-10-10 14:50:40,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-10-10 14:50:40,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 448 transitions. [2018-10-10 14:50:40,784 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 448 transitions. Word has length 108 [2018-10-10 14:50:40,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:40,784 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 448 transitions. [2018-10-10 14:50:40,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:50:40,784 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 448 transitions. [2018-10-10 14:50:40,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-10 14:50:40,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:40,786 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:50:40,786 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:40,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:40,787 INFO L82 PathProgramCache]: Analyzing trace with hash 836497319, now seen corresponding path program 1 times [2018-10-10 14:50:40,787 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:40,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:40,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:40,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:40,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:41,200 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:50:41,200 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:41,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 14:50:41,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 14:50:41,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 14:50:41,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2018-10-10 14:50:41,202 INFO L87 Difference]: Start difference. First operand 441 states and 448 transitions. Second operand 10 states. [2018-10-10 14:50:41,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:41,861 INFO L93 Difference]: Finished difference Result 440 states and 447 transitions. [2018-10-10 14:50:41,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 14:50:41,861 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 109 [2018-10-10 14:50:41,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:41,864 INFO L225 Difference]: With dead ends: 440 [2018-10-10 14:50:41,864 INFO L226 Difference]: Without dead ends: 440 [2018-10-10 14:50:41,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=138, Invalid=324, Unknown=0, NotChecked=0, Total=462 [2018-10-10 14:50:41,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-10-10 14:50:41,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 437. [2018-10-10 14:50:41,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 437 states. [2018-10-10 14:50:41,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 437 states to 437 states and 444 transitions. [2018-10-10 14:50:41,871 INFO L78 Accepts]: Start accepts. Automaton has 437 states and 444 transitions. Word has length 109 [2018-10-10 14:50:41,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:41,871 INFO L481 AbstractCegarLoop]: Abstraction has 437 states and 444 transitions. [2018-10-10 14:50:41,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 14:50:41,871 INFO L276 IsEmpty]: Start isEmpty. Operand 437 states and 444 transitions. [2018-10-10 14:50:41,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-10 14:50:41,873 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:41,873 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:50:41,874 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:41,874 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:41,874 INFO L82 PathProgramCache]: Analyzing trace with hash -753392832, now seen corresponding path program 1 times [2018-10-10 14:50:41,874 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:41,874 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:41,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:41,875 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:41,875 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:41,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:42,116 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:50:42,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:42,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:50:42,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:50:42,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:50:42,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:50:42,118 INFO L87 Difference]: Start difference. First operand 437 states and 444 transitions. Second operand 12 states. [2018-10-10 14:50:44,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:44,408 INFO L93 Difference]: Finished difference Result 1269 states and 1290 transitions. [2018-10-10 14:50:44,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 14:50:44,409 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 109 [2018-10-10 14:50:44,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:44,414 INFO L225 Difference]: With dead ends: 1269 [2018-10-10 14:50:44,414 INFO L226 Difference]: Without dead ends: 1269 [2018-10-10 14:50:44,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2018-10-10 14:50:44,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1269 states. [2018-10-10 14:50:44,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1269 to 436. [2018-10-10 14:50:44,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 436 states. [2018-10-10 14:50:44,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 443 transitions. [2018-10-10 14:50:44,423 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 443 transitions. Word has length 109 [2018-10-10 14:50:44,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:44,423 INFO L481 AbstractCegarLoop]: Abstraction has 436 states and 443 transitions. [2018-10-10 14:50:44,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:50:44,424 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 443 transitions. [2018-10-10 14:50:44,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-10 14:50:44,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:44,425 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:50:44,425 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:44,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:44,426 INFO L82 PathProgramCache]: Analyzing trace with hash 2120759057, now seen corresponding path program 1 times [2018-10-10 14:50:44,426 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:44,426 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:44,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:44,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:44,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:44,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:44,722 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:50:44,722 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:44,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:50:44,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:50:44,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:50:44,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:50:44,724 INFO L87 Difference]: Start difference. First operand 436 states and 443 transitions. Second operand 8 states. [2018-10-10 14:50:45,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:45,319 INFO L93 Difference]: Finished difference Result 921 states and 936 transitions. [2018-10-10 14:50:45,319 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 14:50:45,320 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 121 [2018-10-10 14:50:45,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:45,324 INFO L225 Difference]: With dead ends: 921 [2018-10-10 14:50:45,324 INFO L226 Difference]: Without dead ends: 921 [2018-10-10 14:50:45,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=165, Unknown=0, NotChecked=0, Total=240 [2018-10-10 14:50:45,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2018-10-10 14:50:45,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 435. [2018-10-10 14:50:45,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-10-10 14:50:45,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 442 transitions. [2018-10-10 14:50:45,331 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 442 transitions. Word has length 121 [2018-10-10 14:50:45,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:45,331 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 442 transitions. [2018-10-10 14:50:45,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:50:45,331 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 442 transitions. [2018-10-10 14:50:45,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-10 14:50:45,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:45,332 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:50:45,332 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:45,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:45,333 INFO L82 PathProgramCache]: Analyzing trace with hash -259162422, now seen corresponding path program 1 times [2018-10-10 14:50:45,333 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:45,333 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:45,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:45,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:45,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:45,521 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:50:45,521 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:45,521 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-10 14:50:45,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 14:50:45,522 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 14:50:45,522 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-10-10 14:50:45,522 INFO L87 Difference]: Start difference. First operand 435 states and 442 transitions. Second operand 6 states. [2018-10-10 14:50:46,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:46,023 INFO L93 Difference]: Finished difference Result 651 states and 663 transitions. [2018-10-10 14:50:46,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 14:50:46,024 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-10-10 14:50:46,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:46,027 INFO L225 Difference]: With dead ends: 651 [2018-10-10 14:50:46,028 INFO L226 Difference]: Without dead ends: 651 [2018-10-10 14:50:46,028 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:50:46,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 651 states. [2018-10-10 14:50:46,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 651 to 434. [2018-10-10 14:50:46,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-10 14:50:46,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 441 transitions. [2018-10-10 14:50:46,034 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 441 transitions. Word has length 121 [2018-10-10 14:50:46,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:46,034 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 441 transitions. [2018-10-10 14:50:46,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 14:50:46,034 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 441 transitions. [2018-10-10 14:50:46,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-10 14:50:46,035 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:46,035 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:50:46,036 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:46,036 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:46,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1319021576, now seen corresponding path program 1 times [2018-10-10 14:50:46,036 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:46,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:46,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:46,037 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:46,037 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:46,753 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:50:46,754 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:46,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:50:46,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:50:46,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:50:46,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:50:46,755 INFO L87 Difference]: Start difference. First operand 434 states and 441 transitions. Second operand 13 states. [2018-10-10 14:50:48,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:48,285 INFO L93 Difference]: Finished difference Result 1083 states and 1101 transitions. [2018-10-10 14:50:48,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 14:50:48,285 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 122 [2018-10-10 14:50:48,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:48,290 INFO L225 Difference]: With dead ends: 1083 [2018-10-10 14:50:48,290 INFO L226 Difference]: Without dead ends: 1083 [2018-10-10 14:50:48,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=239, Invalid=691, Unknown=0, NotChecked=0, Total=930 [2018-10-10 14:50:48,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-10-10 14:50:48,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 448. [2018-10-10 14:50:48,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 448 states. [2018-10-10 14:50:48,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 448 states to 448 states and 455 transitions. [2018-10-10 14:50:48,296 INFO L78 Accepts]: Start accepts. Automaton has 448 states and 455 transitions. Word has length 122 [2018-10-10 14:50:48,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:48,296 INFO L481 AbstractCegarLoop]: Abstraction has 448 states and 455 transitions. [2018-10-10 14:50:48,296 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:50:48,296 INFO L276 IsEmpty]: Start isEmpty. Operand 448 states and 455 transitions. [2018-10-10 14:50:48,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-10 14:50:48,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:48,297 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:50:48,298 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:48,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:48,298 INFO L82 PathProgramCache]: Analyzing trace with hash 555899690, now seen corresponding path program 1 times [2018-10-10 14:50:48,298 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:48,298 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:48,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:48,299 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:48,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:48,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:48,426 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:50:48,426 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:48,426 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-10 14:50:48,426 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 14:50:48,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 14:50:48,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:50:48,427 INFO L87 Difference]: Start difference. First operand 448 states and 455 transitions. Second operand 9 states. [2018-10-10 14:50:49,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:49,244 INFO L93 Difference]: Finished difference Result 722 states and 733 transitions. [2018-10-10 14:50:49,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 14:50:49,245 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 122 [2018-10-10 14:50:49,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:49,250 INFO L225 Difference]: With dead ends: 722 [2018-10-10 14:50:49,250 INFO L226 Difference]: Without dead ends: 722 [2018-10-10 14:50:49,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=230, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:50:49,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-10-10 14:50:49,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 447. [2018-10-10 14:50:49,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-10-10 14:50:49,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 454 transitions. [2018-10-10 14:50:49,257 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 454 transitions. Word has length 122 [2018-10-10 14:50:49,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:49,258 INFO L481 AbstractCegarLoop]: Abstraction has 447 states and 454 transitions. [2018-10-10 14:50:49,258 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 14:50:49,258 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 454 transitions. [2018-10-10 14:50:49,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-10 14:50:49,259 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:49,259 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:50:49,259 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:49,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:49,260 INFO L82 PathProgramCache]: Analyzing trace with hash 1347796873, now seen corresponding path program 1 times [2018-10-10 14:50:49,260 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:49,260 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:49,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:49,261 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:49,261 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:49,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:49,337 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:50:49,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:49,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-10 14:50:49,338 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-10 14:50:49,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-10 14:50:49,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-10 14:50:49,339 INFO L87 Difference]: Start difference. First operand 447 states and 454 transitions. Second operand 3 states. [2018-10-10 14:50:49,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:49,462 INFO L93 Difference]: Finished difference Result 476 states and 483 transitions. [2018-10-10 14:50:49,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-10 14:50:49,464 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 124 [2018-10-10 14:50:49,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:49,466 INFO L225 Difference]: With dead ends: 476 [2018-10-10 14:50:49,466 INFO L226 Difference]: Without dead ends: 476 [2018-10-10 14:50:49,468 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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:50:49,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 476 states. [2018-10-10 14:50:49,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 476 to 449. [2018-10-10 14:50:49,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 449 states. [2018-10-10 14:50:49,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 456 transitions. [2018-10-10 14:50:49,473 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 456 transitions. Word has length 124 [2018-10-10 14:50:49,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:49,474 INFO L481 AbstractCegarLoop]: Abstraction has 449 states and 456 transitions. [2018-10-10 14:50:49,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-10 14:50:49,474 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 456 transitions. [2018-10-10 14:50:49,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-10 14:50:49,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:49,475 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:49,475 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:49,476 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:49,476 INFO L82 PathProgramCache]: Analyzing trace with hash 2008438358, now seen corresponding path program 1 times [2018-10-10 14:50:49,476 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:49,476 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:49,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:49,477 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:49,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:49,739 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:50:49,739 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:50:49,739 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:50:49,765 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:49,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:49,842 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:50:50,217 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:50:50,238 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:50:50,245 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-10-10 14:50:50,246 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:50:50,372 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-10-10 14:50:50,372 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:17, output treesize:15 [2018-10-10 14:50:50,860 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:50:50,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:50:50,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 14 [2018-10-10 14:50:50,975 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/optional_data_creation_test04_true-valid-memsafety.i_23.bpl [2018-10-10 14:50:50,988 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 14:50:50,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 14:50:50,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=175, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:50:50,989 INFO L87 Difference]: Start difference. First operand 449 states and 456 transitions. Second operand 15 states. [2018-10-10 14:50:52,444 WARN L178 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 30 DAG size of output: 22 [2018-10-10 14:50:54,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:54,229 INFO L93 Difference]: Finished difference Result 887 states and 902 transitions. [2018-10-10 14:50:54,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 14:50:54,230 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 125 [2018-10-10 14:50:54,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:54,235 INFO L225 Difference]: With dead ends: 887 [2018-10-10 14:50:54,235 INFO L226 Difference]: Without dead ends: 887 [2018-10-10 14:50:54,236 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 122 SyntacticMatches, 4 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 287 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=378, Invalid=1028, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 14:50:54,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2018-10-10 14:50:54,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 439. [2018-10-10 14:50:54,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-10-10 14:50:54,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 445 transitions. [2018-10-10 14:50:54,250 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 445 transitions. Word has length 125 [2018-10-10 14:50:54,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:54,250 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 445 transitions. [2018-10-10 14:50:54,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 14:50:54,250 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 445 transitions. [2018-10-10 14:50:54,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-10 14:50:54,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:54,251 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:50:54,252 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:54,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:54,252 INFO L82 PathProgramCache]: Analyzing trace with hash 24041927, now seen corresponding path program 1 times [2018-10-10 14:50:54,252 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:54,252 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:54,253 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:54,253 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:54,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:54,645 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:50:54,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:50:54,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:50:54,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:50:54,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:50:54,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:50:54,646 INFO L87 Difference]: Start difference. First operand 439 states and 445 transitions. Second operand 12 states. [2018-10-10 14:50:56,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:50:56,228 INFO L93 Difference]: Finished difference Result 780 states and 791 transitions. [2018-10-10 14:50:56,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 14:50:56,228 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 126 [2018-10-10 14:50:56,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:50:56,232 INFO L225 Difference]: With dead ends: 780 [2018-10-10 14:50:56,232 INFO L226 Difference]: Without dead ends: 780 [2018-10-10 14:50:56,233 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=354, Invalid=836, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 14:50:56,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 780 states. [2018-10-10 14:50:56,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 780 to 447. [2018-10-10 14:50:56,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-10-10 14:50:56,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 453 transitions. [2018-10-10 14:50:56,240 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 453 transitions. Word has length 126 [2018-10-10 14:50:56,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:50:56,240 INFO L481 AbstractCegarLoop]: Abstraction has 447 states and 453 transitions. [2018-10-10 14:50:56,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:50:56,241 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 453 transitions. [2018-10-10 14:50:56,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-10 14:50:56,242 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:50:56,242 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:56,242 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:50:56,242 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:50:56,243 INFO L82 PathProgramCache]: Analyzing trace with hash 2132047044, now seen corresponding path program 1 times [2018-10-10 14:50:56,243 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:50:56,243 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:50:56,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:56,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:56,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:50:56,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:56,814 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:50:56,814 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:50:56,814 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:50:56,823 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:50:56,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:50:56,886 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:50:57,097 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:50:57,098 INFO L700 Elim1Store]: detected not equals via solver [2018-10-10 14:50:57,098 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-10-10 14:50:57,099 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:50:57,104 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:50:57,104 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:13 [2018-10-10 14:50:57,114 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 15 [2018-10-10 14:50:57,115 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:50:57,121 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:50:57,122 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:9 [2018-10-10 14:50:57,180 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 3 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:50:57,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:50:57,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14] total 20 [2018-10-10 14:50:57,221 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/optional_data_creation_test04_true-valid-memsafety.i_25.bpl [2018-10-10 14:50:57,223 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 14:50:57,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 14:50:57,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=361, Unknown=0, NotChecked=0, Total=420 [2018-10-10 14:50:57,224 INFO L87 Difference]: Start difference. First operand 447 states and 453 transitions. Second operand 21 states. [2018-10-10 14:51:00,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:51:00,881 INFO L93 Difference]: Finished difference Result 782 states and 794 transitions. [2018-10-10 14:51:00,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 14:51:00,882 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 126 [2018-10-10 14:51:00,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:51:00,885 INFO L225 Difference]: With dead ends: 782 [2018-10-10 14:51:00,885 INFO L226 Difference]: Without dead ends: 782 [2018-10-10 14:51:00,886 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 120 SyntacticMatches, 2 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 792 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=849, Invalid=2573, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 14:51:00,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2018-10-10 14:51:00,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 424. [2018-10-10 14:51:00,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 424 states. [2018-10-10 14:51:00,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 430 transitions. [2018-10-10 14:51:00,892 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 430 transitions. Word has length 126 [2018-10-10 14:51:00,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:51:00,892 INFO L481 AbstractCegarLoop]: Abstraction has 424 states and 430 transitions. [2018-10-10 14:51:00,892 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 14:51:00,892 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 430 transitions. [2018-10-10 14:51:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-10 14:51:00,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:51:00,893 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:51:00,894 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:51:00,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:51:00,894 INFO L82 PathProgramCache]: Analyzing trace with hash 1241592782, now seen corresponding path program 1 times [2018-10-10 14:51:00,894 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:51:00,894 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:51:00,895 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:00,895 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:51:00,896 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:51:01,235 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:51:01,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:51:01,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:51:01,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:51:01,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:51:01,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:51:01,237 INFO L87 Difference]: Start difference. First operand 424 states and 430 transitions. Second operand 13 states. [2018-10-10 14:51:02,623 WARN L178 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 34 [2018-10-10 14:51:03,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:51:03,369 INFO L93 Difference]: Finished difference Result 596 states and 605 transitions. [2018-10-10 14:51:03,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 14:51:03,370 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 130 [2018-10-10 14:51:03,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:51:03,373 INFO L225 Difference]: With dead ends: 596 [2018-10-10 14:51:03,373 INFO L226 Difference]: Without dead ends: 596 [2018-10-10 14:51:03,374 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 272 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=330, Invalid=930, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 14:51:03,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-10-10 14:51:03,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 438. [2018-10-10 14:51:03,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-10-10 14:51:03,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 444 transitions. [2018-10-10 14:51:03,380 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 444 transitions. Word has length 130 [2018-10-10 14:51:03,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:51:03,380 INFO L481 AbstractCegarLoop]: Abstraction has 438 states and 444 transitions. [2018-10-10 14:51:03,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:51:03,380 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 444 transitions. [2018-10-10 14:51:03,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-10 14:51:03,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:51:03,381 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:51:03,382 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:51:03,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:51:03,382 INFO L82 PathProgramCache]: Analyzing trace with hash -165329100, now seen corresponding path program 1 times [2018-10-10 14:51:03,382 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:51:03,382 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:51:03,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:03,383 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:51:03,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:03,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:51:03,701 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:51:03,701 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:51:03,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-10 14:51:03,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 14:51:03,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 14:51:03,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:51:03,702 INFO L87 Difference]: Start difference. First operand 438 states and 444 transitions. Second operand 15 states. [2018-10-10 14:51:05,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:51:05,897 INFO L93 Difference]: Finished difference Result 791 states and 803 transitions. [2018-10-10 14:51:05,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:51:05,898 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 131 [2018-10-10 14:51:05,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:51:05,900 INFO L225 Difference]: With dead ends: 791 [2018-10-10 14:51:05,900 INFO L226 Difference]: Without dead ends: 791 [2018-10-10 14:51:05,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=386, Invalid=874, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 14:51:05,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 791 states. [2018-10-10 14:51:05,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 791 to 474. [2018-10-10 14:51:05,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-10-10 14:51:05,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 481 transitions. [2018-10-10 14:51:05,906 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 481 transitions. Word has length 131 [2018-10-10 14:51:05,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:51:05,906 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 481 transitions. [2018-10-10 14:51:05,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 14:51:05,907 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 481 transitions. [2018-10-10 14:51:05,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-10 14:51:05,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:51:05,907 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:51:05,908 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:51:05,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:51:05,908 INFO L82 PathProgramCache]: Analyzing trace with hash -1471158706, now seen corresponding path program 1 times [2018-10-10 14:51:05,908 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:51:05,908 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:51:05,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:05,909 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:51:05,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:05,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:51:06,106 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:51:06,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:51:06,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 14:51:06,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 14:51:06,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 14:51:06,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2018-10-10 14:51:06,108 INFO L87 Difference]: Start difference. First operand 474 states and 481 transitions. Second operand 8 states. [2018-10-10 14:51:07,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:51:07,305 INFO L93 Difference]: Finished difference Result 929 states and 943 transitions. [2018-10-10 14:51:07,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 14:51:07,306 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 132 [2018-10-10 14:51:07,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:51:07,310 INFO L225 Difference]: With dead ends: 929 [2018-10-10 14:51:07,310 INFO L226 Difference]: Without dead ends: 929 [2018-10-10 14:51:07,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=239, Unknown=0, NotChecked=0, Total=342 [2018-10-10 14:51:07,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2018-10-10 14:51:07,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 473. [2018-10-10 14:51:07,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-10-10 14:51:07,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 480 transitions. [2018-10-10 14:51:07,317 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 480 transitions. Word has length 132 [2018-10-10 14:51:07,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:51:07,317 INFO L481 AbstractCegarLoop]: Abstraction has 473 states and 480 transitions. [2018-10-10 14:51:07,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 14:51:07,317 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 480 transitions. [2018-10-10 14:51:07,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-10 14:51:07,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:51:07,318 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:51:07,319 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:51:07,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:51:07,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1638720632, now seen corresponding path program 1 times [2018-10-10 14:51:07,319 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:51:07,319 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:51:07,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:07,320 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:51:07,320 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:51:07,697 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:51:07,698 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:51:07,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-10 14:51:07,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 14:51:07,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 14:51:07,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:51:07,699 INFO L87 Difference]: Start difference. First operand 473 states and 480 transitions. Second operand 14 states. [2018-10-10 14:51:09,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:51:09,692 INFO L93 Difference]: Finished difference Result 969 states and 983 transitions. [2018-10-10 14:51:09,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 14:51:09,693 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 133 [2018-10-10 14:51:09,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:51:09,697 INFO L225 Difference]: With dead ends: 969 [2018-10-10 14:51:09,697 INFO L226 Difference]: Without dead ends: 969 [2018-10-10 14:51:09,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 343 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=459, Invalid=1263, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 14:51:09,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 969 states. [2018-10-10 14:51:09,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 969 to 472. [2018-10-10 14:51:09,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 472 states. [2018-10-10 14:51:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 472 states to 472 states and 479 transitions. [2018-10-10 14:51:09,704 INFO L78 Accepts]: Start accepts. Automaton has 472 states and 479 transitions. Word has length 133 [2018-10-10 14:51:09,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:51:09,704 INFO L481 AbstractCegarLoop]: Abstraction has 472 states and 479 transitions. [2018-10-10 14:51:09,705 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 14:51:09,705 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 479 transitions. [2018-10-10 14:51:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-10 14:51:09,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:51:09,705 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:51:09,706 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:51:09,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:51:09,706 INFO L82 PathProgramCache]: Analyzing trace with hash -1180564783, now seen corresponding path program 1 times [2018-10-10 14:51:09,706 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:51:09,706 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:51:09,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:09,707 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:51:09,707 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:09,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:51:10,008 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:51:10,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:51:10,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-10-10 14:51:10,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 14:51:10,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 14:51:10,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-10-10 14:51:10,009 INFO L87 Difference]: Start difference. First operand 472 states and 479 transitions. Second operand 14 states. [2018-10-10 14:51:12,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:51:12,215 INFO L93 Difference]: Finished difference Result 965 states and 979 transitions. [2018-10-10 14:51:12,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 14:51:12,215 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 133 [2018-10-10 14:51:12,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:51:12,221 INFO L225 Difference]: With dead ends: 965 [2018-10-10 14:51:12,221 INFO L226 Difference]: Without dead ends: 965 [2018-10-10 14:51:12,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=332, Invalid=858, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 14:51:12,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2018-10-10 14:51:12,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 471. [2018-10-10 14:51:12,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 471 states. [2018-10-10 14:51:12,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 471 states to 471 states and 478 transitions. [2018-10-10 14:51:12,229 INFO L78 Accepts]: Start accepts. Automaton has 471 states and 478 transitions. Word has length 133 [2018-10-10 14:51:12,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:51:12,230 INFO L481 AbstractCegarLoop]: Abstraction has 471 states and 478 transitions. [2018-10-10 14:51:12,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 14:51:12,230 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 478 transitions. [2018-10-10 14:51:12,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-10 14:51:12,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:51:12,231 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:51:12,231 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:51:12,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:51:12,231 INFO L82 PathProgramCache]: Analyzing trace with hash 2057197585, now seen corresponding path program 1 times [2018-10-10 14:51:12,232 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:51:12,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:51:12,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:12,232 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:51:12,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:51:12,639 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:51:12,639 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:51:12,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2018-10-10 14:51:12,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 14:51:12,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 14:51:12,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2018-10-10 14:51:12,640 INFO L87 Difference]: Start difference. First operand 471 states and 478 transitions. Second operand 17 states. [2018-10-10 14:51:13,779 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-10-10 14:51:14,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:51:14,930 INFO L93 Difference]: Finished difference Result 961 states and 974 transitions. [2018-10-10 14:51:14,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:51:14,931 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 134 [2018-10-10 14:51:14,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:51:14,934 INFO L225 Difference]: With dead ends: 961 [2018-10-10 14:51:14,935 INFO L226 Difference]: Without dead ends: 961 [2018-10-10 14:51:14,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=382, Invalid=950, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 14:51:14,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2018-10-10 14:51:14,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 487. [2018-10-10 14:51:14,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-10-10 14:51:14,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 494 transitions. [2018-10-10 14:51:14,947 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 494 transitions. Word has length 134 [2018-10-10 14:51:14,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:51:14,947 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 494 transitions. [2018-10-10 14:51:14,947 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 14:51:14,947 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 494 transitions. [2018-10-10 14:51:14,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-10 14:51:14,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:51:14,948 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:14,949 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:51:14,949 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:51:14,949 INFO L82 PathProgramCache]: Analyzing trace with hash 825924862, now seen corresponding path program 1 times [2018-10-10 14:51:14,949 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:51:14,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:51:14,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:14,951 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:51:14,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:14,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:51:15,198 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:51:15,199 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:51:15,199 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:51:15,209 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:51:15,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:51:15,263 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:51:15,323 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:51:15,353 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:51:15,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2018-10-10 14:51:15,378 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/optional_data_creation_test04_true-valid-memsafety.i_32.bpl [2018-10-10 14:51:15,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 14:51:15,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 14:51:15,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-10 14:51:15,380 INFO L87 Difference]: Start difference. First operand 487 states and 494 transitions. Second operand 7 states. [2018-10-10 14:51:15,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:51:15,436 INFO L93 Difference]: Finished difference Result 525 states and 532 transitions. [2018-10-10 14:51:15,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 14:51:15,436 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 152 [2018-10-10 14:51:15,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:51:15,441 INFO L225 Difference]: With dead ends: 525 [2018-10-10 14:51:15,441 INFO L226 Difference]: Without dead ends: 525 [2018-10-10 14:51:15,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-10 14:51:15,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 525 states. [2018-10-10 14:51:15,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 525 to 499. [2018-10-10 14:51:15,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 499 states. [2018-10-10 14:51:15,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 499 states to 499 states and 506 transitions. [2018-10-10 14:51:15,451 INFO L78 Accepts]: Start accepts. Automaton has 499 states and 506 transitions. Word has length 152 [2018-10-10 14:51:15,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:51:15,451 INFO L481 AbstractCegarLoop]: Abstraction has 499 states and 506 transitions. [2018-10-10 14:51:15,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 14:51:15,451 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 506 transitions. [2018-10-10 14:51:15,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-10 14:51:15,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:51:15,453 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:15,455 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:51:15,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:51:15,455 INFO L82 PathProgramCache]: Analyzing trace with hash -211669919, now seen corresponding path program 1 times [2018-10-10 14:51:15,455 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:51:15,455 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:51:15,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:15,456 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:51:15,456 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:15,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:51:16,041 WARN L178 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2018-10-10 14:51:16,413 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:51:16,413 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:51:16,413 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2018-10-10 14:51:16,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:51:16,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:51:16,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:51:16,415 INFO L87 Difference]: Start difference. First operand 499 states and 506 transitions. Second operand 13 states. [2018-10-10 14:51:18,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:51:18,236 INFO L93 Difference]: Finished difference Result 652 states and 662 transitions. [2018-10-10 14:51:18,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 14:51:18,237 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 153 [2018-10-10 14:51:18,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:51:18,240 INFO L225 Difference]: With dead ends: 652 [2018-10-10 14:51:18,240 INFO L226 Difference]: Without dead ends: 652 [2018-10-10 14:51:18,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=346, Invalid=986, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 14:51:18,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 652 states. [2018-10-10 14:51:18,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 652 to 522. [2018-10-10 14:51:18,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 522 states. [2018-10-10 14:51:18,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 530 transitions. [2018-10-10 14:51:18,247 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 530 transitions. Word has length 153 [2018-10-10 14:51:18,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:51:18,247 INFO L481 AbstractCegarLoop]: Abstraction has 522 states and 530 transitions. [2018-10-10 14:51:18,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:51:18,247 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 530 transitions. [2018-10-10 14:51:18,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-10 14:51:18,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:51:18,248 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:18,249 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:51:18,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:51:18,249 INFO L82 PathProgramCache]: Analyzing trace with hash 2028167452, now seen corresponding path program 1 times [2018-10-10 14:51:18,249 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:51:18,249 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:51:18,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:18,250 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:51:18,250 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:18,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:51:18,621 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:51:18,621 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:51:18,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2018-10-10 14:51:18,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 14:51:18,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 14:51:18,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-10-10 14:51:18,622 INFO L87 Difference]: Start difference. First operand 522 states and 530 transitions. Second operand 15 states. [2018-10-10 14:51:21,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:51:21,015 INFO L93 Difference]: Finished difference Result 837 states and 850 transitions. [2018-10-10 14:51:21,016 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 14:51:21,016 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 154 [2018-10-10 14:51:21,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:51:21,020 INFO L225 Difference]: With dead ends: 837 [2018-10-10 14:51:21,020 INFO L226 Difference]: Without dead ends: 837 [2018-10-10 14:51:21,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=413, Invalid=919, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 14:51:21,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 837 states. [2018-10-10 14:51:21,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 837 to 545. [2018-10-10 14:51:21,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-10-10 14:51:21,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 553 transitions. [2018-10-10 14:51:21,026 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 553 transitions. Word has length 154 [2018-10-10 14:51:21,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:51:21,026 INFO L481 AbstractCegarLoop]: Abstraction has 545 states and 553 transitions. [2018-10-10 14:51:21,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 14:51:21,027 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 553 transitions. [2018-10-10 14:51:21,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-10 14:51:21,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:51:21,027 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:21,029 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:51:21,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:51:21,029 INFO L82 PathProgramCache]: Analyzing trace with hash 156804934, now seen corresponding path program 1 times [2018-10-10 14:51:21,029 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:51:21,029 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:51:21,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:21,030 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:51:21,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:51:22,272 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:51:22,272 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:51:22,272 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:51:22,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:51:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:51:22,335 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:51:22,488 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:51:22,488 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:51:22,493 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:51:22,493 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:13, output treesize:9 [2018-10-10 14:51:22,566 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 13 treesize of output 10 [2018-10-10 14:51:22,568 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 10 treesize of output 9 [2018-10-10 14:51:22,568 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:51:22,570 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:51:22,581 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 13 treesize of output 10 [2018-10-10 14:51:22,584 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 10 treesize of output 9 [2018-10-10 14:51:22,584 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:51:22,585 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:51:22,593 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:51:22,593 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:32, output treesize:21 [2018-10-10 14:51:22,780 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 17 treesize of output 13 [2018-10-10 14:51:22,783 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-10 14:51:22,784 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:51:22,788 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:51:22,799 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:51:22,801 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-10 14:51:22,801 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:51:22,803 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:51:22,809 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:51:22,810 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:34, output treesize:12 [2018-10-10 14:51:23,067 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:51:23,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:51:23,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 31 [2018-10-10 14:51:23,107 WARN L240 PathProgramDumper]: Writing path program to file /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/dump/optional_data_creation_test04_true-valid-memsafety.i_35.bpl [2018-10-10 14:51:23,108 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 14:51:23,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 14:51:23,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=894, Unknown=0, NotChecked=0, Total=992 [2018-10-10 14:51:23,109 INFO L87 Difference]: Start difference. First operand 545 states and 553 transitions. Second operand 32 states. [2018-10-10 14:51:24,887 WARN L178 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 60 [2018-10-10 14:51:25,030 WARN L178 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 65 [2018-10-10 14:51:25,288 WARN L178 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 70 [2018-10-10 14:51:25,533 WARN L178 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 67 [2018-10-10 14:51:26,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:51:26,940 INFO L93 Difference]: Finished difference Result 1058 states and 1073 transitions. [2018-10-10 14:51:26,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 14:51:26,941 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 162 [2018-10-10 14:51:26,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:51:26,945 INFO L225 Difference]: With dead ends: 1058 [2018-10-10 14:51:26,945 INFO L226 Difference]: Without dead ends: 1058 [2018-10-10 14:51:26,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 152 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 637 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=628, Invalid=2342, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 14:51:26,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1058 states. [2018-10-10 14:51:26,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1058 to 561. [2018-10-10 14:51:26,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 561 states. [2018-10-10 14:51:26,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 561 states to 561 states and 569 transitions. [2018-10-10 14:51:26,952 INFO L78 Accepts]: Start accepts. Automaton has 561 states and 569 transitions. Word has length 162 [2018-10-10 14:51:26,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:51:26,952 INFO L481 AbstractCegarLoop]: Abstraction has 561 states and 569 transitions. [2018-10-10 14:51:26,952 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 14:51:26,952 INFO L276 IsEmpty]: Start isEmpty. Operand 561 states and 569 transitions. [2018-10-10 14:51:26,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-10 14:51:26,953 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:51:26,953 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:26,954 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:51:26,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:51:26,954 INFO L82 PathProgramCache]: Analyzing trace with hash 2002712420, now seen corresponding path program 1 times [2018-10-10 14:51:26,954 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:51:26,954 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:51:26,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:26,955 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:51:26,955 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:26,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:51:28,111 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:51:28,112 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:51:28,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2018-10-10 14:51:28,112 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 14:51:28,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 14:51:28,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=800, Unknown=0, NotChecked=0, Total=870 [2018-10-10 14:51:28,113 INFO L87 Difference]: Start difference. First operand 561 states and 569 transitions. Second operand 30 states. [2018-10-10 14:51:30,176 WARN L178 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2018-10-10 14:51:30,625 WARN L178 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 76 [2018-10-10 14:51:31,231 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 86 [2018-10-10 14:51:32,180 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2018-10-10 14:51:32,500 WARN L178 SmtUtils]: Spent 190.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 83 [2018-10-10 14:51:32,716 WARN L178 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-10-10 14:51:33,127 WARN L178 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 76 [2018-10-10 14:51:33,742 WARN L178 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2018-10-10 14:51:34,577 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 100 [2018-10-10 14:51:34,749 WARN L178 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 104 [2018-10-10 14:51:35,591 WARN L178 SmtUtils]: Spent 193.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 94 [2018-10-10 14:51:35,858 WARN L178 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 89 [2018-10-10 14:51:36,072 WARN L178 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 75 [2018-10-10 14:51:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:51:37,298 INFO L93 Difference]: Finished difference Result 1277 states and 1292 transitions. [2018-10-10 14:51:37,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-10 14:51:37,299 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 168 [2018-10-10 14:51:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:51:37,302 INFO L225 Difference]: With dead ends: 1277 [2018-10-10 14:51:37,302 INFO L226 Difference]: Without dead ends: 1277 [2018-10-10 14:51:37,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2150 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=1645, Invalid=7097, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 14:51:37,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1277 states. [2018-10-10 14:51:37,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1277 to 572. [2018-10-10 14:51:37,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2018-10-10 14:51:37,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 580 transitions. [2018-10-10 14:51:37,312 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 580 transitions. Word has length 168 [2018-10-10 14:51:37,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:51:37,312 INFO L481 AbstractCegarLoop]: Abstraction has 572 states and 580 transitions. [2018-10-10 14:51:37,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 14:51:37,312 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 580 transitions. [2018-10-10 14:51:37,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-10 14:51:37,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:51:37,313 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:37,313 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:51:37,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:51:37,314 INFO L82 PathProgramCache]: Analyzing trace with hash 874325720, now seen corresponding path program 1 times [2018-10-10 14:51:37,314 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:51:37,314 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:51:37,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:37,314 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:51:37,314 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:51:37,790 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-10 14:51:38,173 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:51:38,173 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:51:38,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-10-10 14:51:38,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 14:51:38,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 14:51:38,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2018-10-10 14:51:38,174 INFO L87 Difference]: Start difference. First operand 572 states and 580 transitions. Second operand 20 states. [2018-10-10 14:51:43,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:51:43,462 INFO L93 Difference]: Finished difference Result 1174 states and 1191 transitions. [2018-10-10 14:51:43,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 14:51:43,462 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 169 [2018-10-10 14:51:43,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:51:43,468 INFO L225 Difference]: With dead ends: 1174 [2018-10-10 14:51:43,468 INFO L226 Difference]: Without dead ends: 1174 [2018-10-10 14:51:43,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 918 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1040, Invalid=3382, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 14:51:43,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1174 states. [2018-10-10 14:51:43,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1174 to 619. [2018-10-10 14:51:43,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2018-10-10 14:51:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 628 transitions. [2018-10-10 14:51:43,477 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 628 transitions. Word has length 169 [2018-10-10 14:51:43,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:51:43,478 INFO L481 AbstractCegarLoop]: Abstraction has 619 states and 628 transitions. [2018-10-10 14:51:43,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 14:51:43,478 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 628 transitions. [2018-10-10 14:51:43,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-10 14:51:43,479 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:51:43,479 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:43,480 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:51:43,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:51:43,480 INFO L82 PathProgramCache]: Analyzing trace with hash 139217810, now seen corresponding path program 1 times [2018-10-10 14:51:43,480 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:51:43,480 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:51:43,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:43,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:51:43,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:43,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:51:44,147 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:51:44,147 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:51:44,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:51:44,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:51:44,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:51:44,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:51:44,148 INFO L87 Difference]: Start difference. First operand 619 states and 628 transitions. Second operand 12 states. [2018-10-10 14:51:45,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:51:45,237 INFO L93 Difference]: Finished difference Result 762 states and 772 transitions. [2018-10-10 14:51:45,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 14:51:45,238 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 179 [2018-10-10 14:51:45,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:51:45,241 INFO L225 Difference]: With dead ends: 762 [2018-10-10 14:51:45,241 INFO L226 Difference]: Without dead ends: 762 [2018-10-10 14:51:45,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=302, Invalid=754, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 14:51:45,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-10-10 14:51:45,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 691. [2018-10-10 14:51:45,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2018-10-10 14:51:45,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 712 transitions. [2018-10-10 14:51:45,250 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 712 transitions. Word has length 179 [2018-10-10 14:51:45,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:51:45,250 INFO L481 AbstractCegarLoop]: Abstraction has 691 states and 712 transitions. [2018-10-10 14:51:45,250 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:51:45,251 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 712 transitions. [2018-10-10 14:51:45,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-10 14:51:45,252 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:51:45,252 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:45,252 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:51:45,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:51:45,253 INFO L82 PathProgramCache]: Analyzing trace with hash 20785251, now seen corresponding path program 1 times [2018-10-10 14:51:45,253 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:51:45,253 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:51:45,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:45,254 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:51:45,254 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:45,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:51:45,686 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:51:45,686 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 14:51:45,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-10-10 14:51:45,687 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 14:51:45,687 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 14:51:45,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2018-10-10 14:51:45,687 INFO L87 Difference]: Start difference. First operand 691 states and 712 transitions. Second operand 12 states. [2018-10-10 14:51:46,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:51:46,770 INFO L93 Difference]: Finished difference Result 730 states and 743 transitions. [2018-10-10 14:51:46,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 14:51:46,770 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 180 [2018-10-10 14:51:46,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:51:46,773 INFO L225 Difference]: With dead ends: 730 [2018-10-10 14:51:46,773 INFO L226 Difference]: Without dead ends: 730 [2018-10-10 14:51:46,774 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=136, Invalid=370, Unknown=0, NotChecked=0, Total=506 [2018-10-10 14:51:46,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-10-10 14:51:46,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 700. [2018-10-10 14:51:46,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 700 states. [2018-10-10 14:51:46,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 721 transitions. [2018-10-10 14:51:46,781 INFO L78 Accepts]: Start accepts. Automaton has 700 states and 721 transitions. Word has length 180 [2018-10-10 14:51:46,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:51:46,781 INFO L481 AbstractCegarLoop]: Abstraction has 700 states and 721 transitions. [2018-10-10 14:51:46,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 14:51:46,782 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 721 transitions. [2018-10-10 14:51:46,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-10 14:51:46,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:51:46,783 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:51:46,783 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:51:46,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:51:46,783 INFO L82 PathProgramCache]: Analyzing trace with hash 1843751155, now seen corresponding path program 2 times [2018-10-10 14:51:46,783 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:51:46,783 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:51:46,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:46,784 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-10 14:51:46,784 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:51:46,926 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:51:46,926 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:51:46,926 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:51:46,934 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:51:46,979 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2018-10-10 14:51:46,979 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:51:46,983 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:51:47,211 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2018-10-10 14:51:47,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2018-10-10 14:51:47,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 13 [2018-10-10 14:51:47,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 14:51:47,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 14:51:47,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2018-10-10 14:51:47,233 INFO L87 Difference]: Start difference. First operand 700 states and 721 transitions. Second operand 13 states. [2018-10-10 14:51:48,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 14:51:48,370 INFO L93 Difference]: Finished difference Result 963 states and 986 transitions. [2018-10-10 14:51:48,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 14:51:48,371 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 180 [2018-10-10 14:51:48,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 14:51:48,374 INFO L225 Difference]: With dead ends: 963 [2018-10-10 14:51:48,374 INFO L226 Difference]: Without dead ends: 963 [2018-10-10 14:51:48,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=218, Invalid=538, Unknown=0, NotChecked=0, Total=756 [2018-10-10 14:51:48,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2018-10-10 14:51:48,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 711. [2018-10-10 14:51:48,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 711 states. [2018-10-10 14:51:48,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 732 transitions. [2018-10-10 14:51:48,387 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 732 transitions. Word has length 180 [2018-10-10 14:51:48,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 14:51:48,387 INFO L481 AbstractCegarLoop]: Abstraction has 711 states and 732 transitions. [2018-10-10 14:51:48,387 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 14:51:48,387 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 732 transitions. [2018-10-10 14:51:48,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-10 14:51:48,388 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 14:51:48,389 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 14:51:48,389 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr15ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr38ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr3ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_DEREFERENCE]=== [2018-10-10 14:51:48,389 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 14:51:48,389 INFO L82 PathProgramCache]: Analyzing trace with hash -769604357, now seen corresponding path program 2 times [2018-10-10 14:51:48,389 INFO L227 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-10 14:51:48,390 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-10 14:51:48,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:48,390 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-10 14:51:48,390 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-10 14:51:48,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 14:51:49,103 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:51:49,104 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-10-10 14:51:49,104 INFO L227 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-10-10 14:51:49,112 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-10-10 14:51:49,177 INFO L242 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-10-10 14:51:49,178 INFO L243 tOrderPrioritization]: Conjunction of SSA is unsat [2018-10-10 14:51:49,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-10 14:51:49,249 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:51:49,250 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-10-10 14:51:49,343 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:51:49,344 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:16, output treesize:12 [2018-10-10 14:51:49,377 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:51:49,379 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:51:49,380 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:51:49,381 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:51:49,393 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:51:49,395 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:51:49,395 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:51:49,397 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:51:49,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:51:49,405 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:31, output treesize:20 [2018-10-10 14:51:49,636 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 17 treesize of output 13 [2018-10-10 14:51:49,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 5 [2018-10-10 14:51:49,639 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-10 14:51:49,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:51:49,654 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:51:49,658 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2018-10-10 14:51:49,658 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-10 14:51:49,660 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:51:49,667 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-10-10 14:51:49,668 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:37, output treesize:15 [2018-10-10 14:51:49,857 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 36 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 14:51:49,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-10-10 14:51:49,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 30 [2018-10-10 14:51:49,879 WARN L550 AbstractCegarLoop]: Verification canceled [2018-10-10 14:51:49,883 WARN L205 ceAbstractionStarter]: Timeout [2018-10-10 14:51:49,883 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 02:51:49 BoogieIcfgContainer [2018-10-10 14:51:49,883 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 14:51:49,884 INFO L168 Benchmark]: Toolchain (without parser) took 90676.47 ms. Allocated memory was 1.6 GB in the beginning and 2.9 GB in the end (delta: 1.3 GB). Free memory was 1.4 GB in the beginning and 2.8 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-10 14:51:49,885 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:51:49,885 INFO L168 Benchmark]: CACSL2BoogieTranslator took 510.31 ms. Allocated memory is still 1.6 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:51:49,886 INFO L168 Benchmark]: Boogie Procedure Inliner took 78.63 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 14:51:49,886 INFO L168 Benchmark]: Boogie Preprocessor took 134.21 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -825.3 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. [2018-10-10 14:51:49,887 INFO L168 Benchmark]: RCFGBuilder took 1736.09 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: 85.4 MB). Peak memory consumption was 85.4 MB. Max. memory is 7.1 GB. [2018-10-10 14:51:49,888 INFO L168 Benchmark]: TraceAbstraction took 88210.02 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 570.9 MB). Free memory was 2.2 GB in the beginning and 2.8 GB in the end (delta: -653.6 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2018-10-10 14:51:49,891 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 510.31 ms. Allocated memory is still 1.6 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 78.63 ms. Allocated memory is still 1.6 GB. Free memory is still 1.4 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 134.21 ms. Allocated memory was 1.6 GB in the beginning and 2.3 GB in the end (delta: 746.1 MB). Free memory was 1.4 GB in the beginning and 2.2 GB in the end (delta: -825.3 MB). Peak memory consumption was 27.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1736.09 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: 85.4 MB). Peak memory consumption was 85.4 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88210.02 ms. Allocated memory was 2.3 GB in the beginning and 2.9 GB in the end (delta: 570.9 MB). Free memory was 2.2 GB in the beginning and 2.8 GB in the end (delta: -653.6 MB). Peak memory consumption was 1.1 GB. 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 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 579). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 560). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: 562]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 562). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: 579]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 579). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: 562]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 562). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: 570]: Timeout (TraceAbstraction) Unable to prove that all allocated memory was freed (line 570). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: 560]: Timeout (TraceAbstraction) Unable to prove that free always succeeds (line 560). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - TimeoutResultAtElement [Line: -1]: Timeout (TraceAbstraction) Unable to prove that pointer dereference always succeeds (line -1). Cancelled while PathProgramDumpController was trying to verify (iteration 41). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 391 locations, 45 error locations. TIMEOUT Result, 88.1s OverallTime, 41 OverallIterations, 3 TraceHistogramMax, 67.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16520 SDtfs, 95611 SDslu, 77226 SDs, 0 SdLazy, 36357 SolverSat, 1548 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 35.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1852 GetRequests, 852 SyntacticMatches, 8 SemanticMatches, 992 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7790 ImplicationChecksByTransitivity, 38.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=711occurred in iteration=40, 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.3s AutomataMinimizationTime, 40 MinimizatonAttempts, 13277 StatesRemovedByMinimization, 40 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 16.3s InterpolantComputationTime, 5418 NumberOfCodeBlocks, 5362 NumberOfCodeBlocksAsserted, 45 NumberOfCheckSat, 5373 ConstructedInterpolants, 9 QuantifiedInterpolants, 4400510 SizeOfPredicates, 62 NumberOfNonLiveVariables, 1437 ConjunctsInSsa, 113 ConjunctsInUnsatCore, 45 InterpolantComputations, 36 PerfectInterpolantSequences, 44/190 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Received shutdown request...