./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety-ext3/freeAlloca_false-valid-free.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0ed9222f Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -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 -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/svcomp/c/memsafety-ext3/freeAlloca_false-valid-free.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2749915c63b6e758ac6033a38fbdad80769d2869 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-free) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 00:37:19,420 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 00:37:19,421 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 00:37:19,432 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 00:37:19,433 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 00:37:19,434 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 00:37:19,435 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 00:37:19,437 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 00:37:19,438 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 00:37:19,439 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 00:37:19,440 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 00:37:19,440 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 00:37:19,442 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 00:37:19,443 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 00:37:19,444 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 00:37:19,445 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 00:37:19,446 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 00:37:19,448 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 00:37:19,450 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 00:37:19,451 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 00:37:19,452 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 00:37:19,454 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 00:37:19,457 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 00:37:19,457 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 00:37:19,457 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 00:37:19,458 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 00:37:19,460 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 00:37:19,461 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 00:37:19,462 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 00:37:19,463 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 00:37:19,464 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 00:37:19,464 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 00:37:19,465 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 00:37:19,465 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 00:37:19,466 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 00:37:19,467 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 00:37:19,467 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 00:37:19,482 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 00:37:19,482 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 00:37:19,483 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 00:37:19,483 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 00:37:19,483 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 00:37:19,484 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 00:37:19,485 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 00:37:19,485 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 00:37:19,485 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 00:37:19,485 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 00:37:19,485 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 00:37:19,485 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 00:37:19,486 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 00:37:19,486 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 00:37:19,486 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 00:37:19,486 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 00:37:19,486 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-14 00:37:19,486 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 00:37:19,487 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 00:37:19,488 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 00:37:19,488 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 00:37:19,488 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 00:37:19,489 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 00:37:19,489 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 00:37:19,489 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 00:37:19,489 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 00:37:19,489 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.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2749915c63b6e758ac6033a38fbdad80769d2869 [2019-01-14 00:37:19,546 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 00:37:19,563 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 00:37:19,568 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 00:37:19,570 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 00:37:19,570 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 00:37:19,571 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/freeAlloca_false-valid-free.c [2019-01-14 00:37:19,636 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aefa700ba/a638e9b8ff42406aa9be99a9bb97306d/FLAGf15620140 [2019-01-14 00:37:20,067 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 00:37:20,068 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/freeAlloca_false-valid-free.c [2019-01-14 00:37:20,075 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aefa700ba/a638e9b8ff42406aa9be99a9bb97306d/FLAGf15620140 [2019-01-14 00:37:20,415 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aefa700ba/a638e9b8ff42406aa9be99a9bb97306d [2019-01-14 00:37:20,418 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 00:37:20,420 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 00:37:20,421 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 00:37:20,421 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 00:37:20,424 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 00:37:20,425 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:37:20" (1/1) ... [2019-01-14 00:37:20,428 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71edaa93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:20, skipping insertion in model container [2019-01-14 00:37:20,429 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 12:37:20" (1/1) ... [2019-01-14 00:37:20,437 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 00:37:20,455 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 00:37:20,614 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:37:20,626 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 00:37:20,638 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 00:37:20,653 INFO L195 MainTranslator]: Completed translation [2019-01-14 00:37:20,654 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:20 WrapperNode [2019-01-14 00:37:20,654 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 00:37:20,655 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 00:37:20,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 00:37:20,655 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 00:37:20,668 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:20" (1/1) ... [2019-01-14 00:37:20,669 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:20" (1/1) ... [2019-01-14 00:37:20,677 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:20" (1/1) ... [2019-01-14 00:37:20,677 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:20" (1/1) ... [2019-01-14 00:37:20,687 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:20" (1/1) ... [2019-01-14 00:37:20,692 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:20" (1/1) ... [2019-01-14 00:37:20,694 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:20" (1/1) ... [2019-01-14 00:37:20,695 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 00:37:20,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 00:37:20,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 00:37:20,696 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 00:37:20,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:20" (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 [2019-01-14 00:37:20,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 00:37:20,802 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 00:37:20,803 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 00:37:20,803 INFO L130 BoogieDeclarations]: Found specification of procedure alloca [2019-01-14 00:37:20,803 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 00:37:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-01-14 00:37:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 00:37:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-14 00:37:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 00:37:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 00:37:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 00:37:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 00:37:20,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 00:37:21,198 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 00:37:21,199 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-14 00:37:21,200 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:37:21 BoogieIcfgContainer [2019-01-14 00:37:21,200 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 00:37:21,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 00:37:21,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 00:37:21,203 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 00:37:21,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 12:37:20" (1/3) ... [2019-01-14 00:37:21,204 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75168b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:37:21, skipping insertion in model container [2019-01-14 00:37:21,204 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 12:37:20" (2/3) ... [2019-01-14 00:37:21,205 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@75168b9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 12:37:21, skipping insertion in model container [2019-01-14 00:37:21,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:37:21" (3/3) ... [2019-01-14 00:37:21,208 INFO L112 eAbstractionObserver]: Analyzing ICFG freeAlloca_false-valid-free.c [2019-01-14 00:37:21,217 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 00:37:21,225 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-01-14 00:37:21,241 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-01-14 00:37:21,263 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 00:37:21,264 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 00:37:21,264 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 00:37:21,264 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 00:37:21,264 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 00:37:21,264 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 00:37:21,265 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 00:37:21,265 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 00:37:21,266 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 00:37:21,281 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states. [2019-01-14 00:37:21,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 00:37:21,292 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:21,292 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:21,295 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 00:37:21,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:21,301 INFO L82 PathProgramCache]: Analyzing trace with hash 996996062, now seen corresponding path program 1 times [2019-01-14 00:37:21,303 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:21,303 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:21,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:21,343 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:21,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:21,413 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:21,416 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:37:21,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:37:21,420 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-01-14 00:37:21,432 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-01-14 00:37:21,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 00:37:21,436 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 2 states. [2019-01-14 00:37:21,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:21,450 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2019-01-14 00:37:21,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-01-14 00:37:21,451 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 8 [2019-01-14 00:37:21,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:21,460 INFO L225 Difference]: With dead ends: 28 [2019-01-14 00:37:21,460 INFO L226 Difference]: Without dead ends: 25 [2019-01-14 00:37:21,462 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-01-14 00:37:21,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-14 00:37:21,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2019-01-14 00:37:21,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-01-14 00:37:21,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 26 transitions. [2019-01-14 00:37:21,500 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 26 transitions. Word has length 8 [2019-01-14 00:37:21,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:21,501 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 26 transitions. [2019-01-14 00:37:21,501 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-01-14 00:37:21,501 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2019-01-14 00:37:21,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 00:37:21,502 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:21,503 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:21,503 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 00:37:21,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:21,504 INFO L82 PathProgramCache]: Analyzing trace with hash 996995752, now seen corresponding path program 1 times [2019-01-14 00:37:21,504 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:21,504 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:21,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:21,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:21,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:21,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:21,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:21,600 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:37:21,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 00:37:21,602 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:37:21,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:37:21,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:37:21,604 INFO L87 Difference]: Start difference. First operand 25 states and 26 transitions. Second operand 3 states. [2019-01-14 00:37:21,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:21,736 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2019-01-14 00:37:21,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:37:21,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 00:37:21,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:21,739 INFO L225 Difference]: With dead ends: 31 [2019-01-14 00:37:21,739 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 00:37:21,740 INFO L631 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 [2019-01-14 00:37:21,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 00:37:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 26. [2019-01-14 00:37:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 00:37:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 27 transitions. [2019-01-14 00:37:21,747 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 27 transitions. Word has length 8 [2019-01-14 00:37:21,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:21,747 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 27 transitions. [2019-01-14 00:37:21,747 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:37:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 27 transitions. [2019-01-14 00:37:21,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 00:37:21,748 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:21,748 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:21,749 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 00:37:21,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:21,750 INFO L82 PathProgramCache]: Analyzing trace with hash 996995806, now seen corresponding path program 1 times [2019-01-14 00:37:21,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:21,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:21,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:21,752 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:21,752 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:21,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:21,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:37:21,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:37:21,919 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:37:21,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:37:21,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:37:21,920 INFO L87 Difference]: Start difference. First operand 26 states and 27 transitions. Second operand 3 states. [2019-01-14 00:37:22,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:22,048 INFO L93 Difference]: Finished difference Result 30 states and 31 transitions. [2019-01-14 00:37:22,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:37:22,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 00:37:22,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:22,050 INFO L225 Difference]: With dead ends: 30 [2019-01-14 00:37:22,050 INFO L226 Difference]: Without dead ends: 30 [2019-01-14 00:37:22,051 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:37:22,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-01-14 00:37:22,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2019-01-14 00:37:22,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2019-01-14 00:37:22,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2019-01-14 00:37:22,057 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 8 [2019-01-14 00:37:22,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:22,057 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2019-01-14 00:37:22,057 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:37:22,057 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2019-01-14 00:37:22,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 00:37:22,058 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:22,058 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:22,058 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 00:37:22,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:22,060 INFO L82 PathProgramCache]: Analyzing trace with hash 996995805, now seen corresponding path program 1 times [2019-01-14 00:37:22,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:22,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:22,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:22,062 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:22,062 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:22,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:22,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:22,121 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:37:22,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:37:22,121 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:37:22,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:37:22,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:37:22,122 INFO L87 Difference]: Start difference. First operand 27 states and 29 transitions. Second operand 3 states. [2019-01-14 00:37:22,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:22,208 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2019-01-14 00:37:22,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:37:22,209 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 00:37:22,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:22,209 INFO L225 Difference]: With dead ends: 25 [2019-01-14 00:37:22,209 INFO L226 Difference]: Without dead ends: 25 [2019-01-14 00:37:22,210 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:37:22,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2019-01-14 00:37:22,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2019-01-14 00:37:22,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 00:37:22,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-14 00:37:22,214 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 8 [2019-01-14 00:37:22,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:22,215 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-14 00:37:22,215 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:37:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-14 00:37:22,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 00:37:22,217 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:22,217 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:22,217 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 00:37:22,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:22,219 INFO L82 PathProgramCache]: Analyzing trace with hash 63449068, now seen corresponding path program 1 times [2019-01-14 00:37:22,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:22,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:22,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:22,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:22,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:22,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:22,337 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-01-14 00:37:22,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:37:22,337 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 00:37:22,339 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 00:37:22,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 00:37:22,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:37:22,339 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 3 states. [2019-01-14 00:37:22,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:22,378 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2019-01-14 00:37:22,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 00:37:22,379 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-14 00:37:22,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:22,380 INFO L225 Difference]: With dead ends: 22 [2019-01-14 00:37:22,380 INFO L226 Difference]: Without dead ends: 22 [2019-01-14 00:37:22,381 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 00:37:22,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-01-14 00:37:22,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-01-14 00:37:22,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-01-14 00:37:22,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2019-01-14 00:37:22,385 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 12 [2019-01-14 00:37:22,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:22,385 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2019-01-14 00:37:22,386 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 00:37:22,386 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2019-01-14 00:37:22,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 00:37:22,386 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:22,386 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:22,388 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 00:37:22,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:22,389 INFO L82 PathProgramCache]: Analyzing trace with hash 63449121, now seen corresponding path program 1 times [2019-01-14 00:37:22,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:22,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:22,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:22,391 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:22,391 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:22,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:22,640 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:22,641 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 00:37:22,641 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 00:37:22,641 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 00:37:22,642 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 00:37:22,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:37:22,642 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 6 states. [2019-01-14 00:37:22,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:22,713 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-01-14 00:37:22,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 00:37:22,715 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-01-14 00:37:22,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:22,716 INFO L225 Difference]: With dead ends: 23 [2019-01-14 00:37:22,716 INFO L226 Difference]: Without dead ends: 23 [2019-01-14 00:37:22,718 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 00:37:22,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-01-14 00:37:22,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2019-01-14 00:37:22,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-01-14 00:37:22,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-01-14 00:37:22,722 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 12 [2019-01-14 00:37:22,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:22,722 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-01-14 00:37:22,722 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 00:37:22,722 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-01-14 00:37:22,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-01-14 00:37:22,724 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:22,724 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:22,724 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 00:37:22,724 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:22,725 INFO L82 PathProgramCache]: Analyzing trace with hash 425550780, now seen corresponding path program 1 times [2019-01-14 00:37:22,725 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:22,725 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:22,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:22,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:22,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:22,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:22,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:22,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:22,792 INFO L223 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 [2019-01-14 00:37:22,803 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:22,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:22,834 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:22,860 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:22,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:22,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 00:37:22,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 00:37:22,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 00:37:22,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:37:22,884 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 5 states. [2019-01-14 00:37:22,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:22,955 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2019-01-14 00:37:22,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 00:37:22,956 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2019-01-14 00:37:22,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:22,956 INFO L225 Difference]: With dead ends: 27 [2019-01-14 00:37:22,957 INFO L226 Difference]: Without dead ends: 27 [2019-01-14 00:37:22,959 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 00:37:22,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-01-14 00:37:22,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 24. [2019-01-14 00:37:22,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-01-14 00:37:22,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2019-01-14 00:37:22,963 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 15 [2019-01-14 00:37:22,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:22,964 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2019-01-14 00:37:22,964 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 00:37:22,964 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2019-01-14 00:37:22,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-01-14 00:37:22,965 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:22,965 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:22,965 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 00:37:22,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:22,966 INFO L82 PathProgramCache]: Analyzing trace with hash 316362009, now seen corresponding path program 2 times [2019-01-14 00:37:22,966 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:22,966 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:22,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:22,967 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:22,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:22,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:23,027 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:23,028 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:23,028 INFO L223 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 [2019-01-14 00:37:23,039 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:37:23,055 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 00:37:23,055 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:23,057 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:23,548 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-01-14 00:37:23,570 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 00:37:23,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 8 [2019-01-14 00:37:23,571 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 00:37:23,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 00:37:23,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=38, Unknown=1, NotChecked=0, Total=56 [2019-01-14 00:37:23,572 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2019-01-14 00:37:28,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:28,080 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2019-01-14 00:37:28,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:37:28,082 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 19 [2019-01-14 00:37:28,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:28,083 INFO L225 Difference]: With dead ends: 33 [2019-01-14 00:37:28,083 INFO L226 Difference]: Without dead ends: 31 [2019-01-14 00:37:28,084 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=35, Invalid=74, Unknown=1, NotChecked=0, Total=110 [2019-01-14 00:37:28,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2019-01-14 00:37:28,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2019-01-14 00:37:28,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-01-14 00:37:28,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-01-14 00:37:28,088 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 19 [2019-01-14 00:37:28,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:28,089 INFO L480 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-01-14 00:37:28,089 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 00:37:28,089 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-01-14 00:37:28,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 00:37:28,091 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:28,091 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:28,091 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 00:37:28,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:28,092 INFO L82 PathProgramCache]: Analyzing trace with hash -564453139, now seen corresponding path program 1 times [2019-01-14 00:37:28,092 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:28,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:28,093 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:28,093 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:28,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:28,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:28,223 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:28,223 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:28,223 INFO L223 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 [2019-01-14 00:37:28,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:28,286 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:28,385 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:28,416 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:28,416 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 00:37:28,417 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 00:37:28,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 00:37:28,417 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:37:28,420 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 7 states. [2019-01-14 00:37:28,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:28,532 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2019-01-14 00:37:28,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 00:37:28,534 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-14 00:37:28,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:28,535 INFO L225 Difference]: With dead ends: 35 [2019-01-14 00:37:28,536 INFO L226 Difference]: Without dead ends: 35 [2019-01-14 00:37:28,536 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 00:37:28,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2019-01-14 00:37:28,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2019-01-14 00:37:28,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-01-14 00:37:28,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-01-14 00:37:28,543 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 23 [2019-01-14 00:37:28,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:28,543 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-01-14 00:37:28,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 00:37:28,546 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-01-14 00:37:28,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 00:37:28,547 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:28,547 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:28,548 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 00:37:28,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:28,555 INFO L82 PathProgramCache]: Analyzing trace with hash 817651018, now seen corresponding path program 2 times [2019-01-14 00:37:28,555 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:28,555 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:28,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:28,556 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:28,556 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:28,764 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:28,765 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:28,765 INFO L223 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 [2019-01-14 00:37:28,779 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 00:37:28,812 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 00:37:28,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:28,816 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:28,850 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:28,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:28,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 00:37:28,872 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 00:37:28,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 00:37:28,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:37:28,873 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 8 states. [2019-01-14 00:37:28,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:28,936 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-01-14 00:37:28,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 00:37:28,938 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-01-14 00:37:28,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:28,939 INFO L225 Difference]: With dead ends: 39 [2019-01-14 00:37:28,939 INFO L226 Difference]: Without dead ends: 39 [2019-01-14 00:37:28,939 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 00:37:28,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-14 00:37:28,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2019-01-14 00:37:28,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-01-14 00:37:28,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-01-14 00:37:28,945 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 27 [2019-01-14 00:37:28,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:28,945 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-01-14 00:37:28,945 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 00:37:28,945 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-01-14 00:37:28,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 00:37:28,946 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:28,946 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:28,948 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 00:37:28,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:28,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1120001241, now seen corresponding path program 3 times [2019-01-14 00:37:28,948 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:28,948 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:28,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:28,949 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:28,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:28,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:29,081 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:29,082 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:29,082 INFO L223 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 [2019-01-14 00:37:29,093 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 00:37:29,155 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-14 00:37:29,155 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:29,158 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:29,222 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:29,259 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:29,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-14 00:37:29,260 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 00:37:29,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 00:37:29,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:37:29,262 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 9 states. [2019-01-14 00:37:29,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:29,342 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2019-01-14 00:37:29,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 00:37:29,343 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-01-14 00:37:29,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:29,346 INFO L225 Difference]: With dead ends: 43 [2019-01-14 00:37:29,346 INFO L226 Difference]: Without dead ends: 43 [2019-01-14 00:37:29,347 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 00:37:29,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-01-14 00:37:29,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 40. [2019-01-14 00:37:29,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2019-01-14 00:37:29,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2019-01-14 00:37:29,351 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 31 [2019-01-14 00:37:29,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:29,351 INFO L480 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2019-01-14 00:37:29,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 00:37:29,351 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2019-01-14 00:37:29,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 00:37:29,354 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:29,354 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:29,354 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 00:37:29,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:29,355 INFO L82 PathProgramCache]: Analyzing trace with hash 92254852, now seen corresponding path program 4 times [2019-01-14 00:37:29,356 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:29,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:29,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:29,357 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:29,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:29,510 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:29,510 INFO L223 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 [2019-01-14 00:37:29,531 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 00:37:29,563 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 00:37:29,563 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:29,567 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:29,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:29,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-14 00:37:29,624 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 00:37:29,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 00:37:29,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:37:29,625 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 10 states. [2019-01-14 00:37:29,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:29,952 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-01-14 00:37:29,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 00:37:29,953 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-01-14 00:37:29,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:29,954 INFO L225 Difference]: With dead ends: 47 [2019-01-14 00:37:29,954 INFO L226 Difference]: Without dead ends: 47 [2019-01-14 00:37:29,956 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 00:37:29,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2019-01-14 00:37:29,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2019-01-14 00:37:29,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-01-14 00:37:29,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-01-14 00:37:29,961 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 35 [2019-01-14 00:37:29,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:29,962 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-01-14 00:37:29,962 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 00:37:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-01-14 00:37:29,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 00:37:29,963 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:29,963 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:29,966 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 00:37:29,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:29,967 INFO L82 PathProgramCache]: Analyzing trace with hash 696273761, now seen corresponding path program 5 times [2019-01-14 00:37:29,967 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:29,967 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:29,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:29,968 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:29,968 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:30,149 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:30,150 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:30,150 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:37:30,159 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 00:37:30,289 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-01-14 00:37:30,289 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:30,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:30,403 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:30,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:30,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-14 00:37:30,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 00:37:30,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 00:37:30,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:37:30,435 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 11 states. [2019-01-14 00:37:30,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:30,565 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2019-01-14 00:37:30,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 00:37:30,566 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-01-14 00:37:30,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:30,567 INFO L225 Difference]: With dead ends: 51 [2019-01-14 00:37:30,567 INFO L226 Difference]: Without dead ends: 51 [2019-01-14 00:37:30,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 00:37:30,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2019-01-14 00:37:30,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2019-01-14 00:37:30,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-01-14 00:37:30,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2019-01-14 00:37:30,574 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 39 [2019-01-14 00:37:30,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:30,574 INFO L480 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2019-01-14 00:37:30,574 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 00:37:30,574 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2019-01-14 00:37:30,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 00:37:30,577 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:30,578 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:30,578 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 00:37:30,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:30,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1214304834, now seen corresponding path program 6 times [2019-01-14 00:37:30,579 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:30,579 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:30,579 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:30,579 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:30,580 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:30,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:30,732 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:30,732 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:30,733 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:37:30,742 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 00:37:30,794 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-01-14 00:37:30,794 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 00:37:30,797 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:30,867 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:30,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-14 00:37:30,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 00:37:30,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 00:37:30,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:37:30,869 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 12 states. [2019-01-14 00:37:31,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:31,056 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2019-01-14 00:37:31,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 00:37:31,057 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2019-01-14 00:37:31,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:31,058 INFO L225 Difference]: With dead ends: 55 [2019-01-14 00:37:31,058 INFO L226 Difference]: Without dead ends: 55 [2019-01-14 00:37:31,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 00:37:31,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-01-14 00:37:31,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 52. [2019-01-14 00:37:31,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-01-14 00:37:31,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-01-14 00:37:31,064 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 43 [2019-01-14 00:37:31,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:31,064 INFO L480 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-01-14 00:37:31,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 00:37:31,064 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-01-14 00:37:31,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 00:37:31,065 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:31,065 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:31,068 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 00:37:31,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:31,069 INFO L82 PathProgramCache]: Analyzing trace with hash 2090572187, now seen corresponding path program 7 times [2019-01-14 00:37:31,069 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:31,069 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:31,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:31,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 00:37:31,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:31,314 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 00:37:31,314 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-01-14 00:37:31,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 00:37:31,348 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 00:37:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-14 00:37:31,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 00:37:31,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-14 00:37:31,401 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 00:37:31,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 00:37:31,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:37:31,402 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 13 states. [2019-01-14 00:37:31,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 00:37:31,491 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2019-01-14 00:37:31,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 00:37:31,492 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-01-14 00:37:31,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 00:37:31,493 INFO L225 Difference]: With dead ends: 56 [2019-01-14 00:37:31,493 INFO L226 Difference]: Without dead ends: 56 [2019-01-14 00:37:31,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 00:37:31,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-14 00:37:31,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2019-01-14 00:37:31,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2019-01-14 00:37:31,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2019-01-14 00:37:31,500 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 47 [2019-01-14 00:37:31,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 00:37:31,500 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2019-01-14 00:37:31,500 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 00:37:31,500 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2019-01-14 00:37:31,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-14 00:37:31,501 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 00:37:31,501 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 00:37:31,501 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr1REQUIRES_VIOLATION, mainErr2REQUIRES_VIOLATION, mainErr3REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5ASSERT_VIOLATIONMEMORY_FREE, mainErr6ASSERT_VIOLATIONMEMORY_FREE]=== [2019-01-14 00:37:31,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 00:37:31,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1402261240, now seen corresponding path program 8 times [2019-01-14 00:37:31,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 00:37:31,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 00:37:31,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:31,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 00:37:31,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 00:37:31,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 00:37:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 00:37:31,665 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 00:37:31,738 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 12:37:31 BoogieIcfgContainer [2019-01-14 00:37:31,739 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 00:37:31,739 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 00:37:31,739 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 00:37:31,741 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 00:37:31,743 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 12:37:21" (3/4) ... [2019-01-14 00:37:31,747 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 00:37:31,866 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 00:37:31,866 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 00:37:31,870 INFO L168 Benchmark]: Toolchain (without parser) took 11451.48 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 208.7 MB). Free memory was 951.4 MB in the beginning and 1.1 GB in the end (delta: -176.2 MB). Peak memory consumption was 32.5 MB. Max. memory is 11.5 GB. [2019-01-14 00:37:31,875 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:37:31,875 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.76 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 00:37:31,876 INFO L168 Benchmark]: Boogie Preprocessor took 40.73 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 00:37:31,877 INFO L168 Benchmark]: RCFGBuilder took 503.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2019-01-14 00:37:31,877 INFO L168 Benchmark]: TraceAbstraction took 10538.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.6 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. [2019-01-14 00:37:31,882 INFO L168 Benchmark]: Witness Printer took 126.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. [2019-01-14 00:37:31,888 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 233.76 ms. Allocated memory is still 1.0 GB. Free memory was 951.4 MB in the beginning and 940.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 40.73 ms. Allocated memory is still 1.0 GB. Free memory is still 940.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 503.65 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 152.0 MB). Free memory was 940.6 MB in the beginning and 1.1 GB in the end (delta: -182.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 10538.22 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 56.6 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -4.6 MB). Peak memory consumption was 52.0 MB. Max. memory is 11.5 GB. * Witness Printer took 126.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24 B). Peak memory consumption was 24 B. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 13]: free of unallocated memory possible free of unallocated memory possible We found a FailurePath: [L6] char *p = alloca(10 * sizeof(char)); [L8] int i = 0; VAL [alloca(10 * sizeof(char))={12:0}, i=0, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=0, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=1, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=1, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=2, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=97, alloca(10 * sizeof(char))={12:0}, i=2, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=3, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=3, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=4, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=4, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=5, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=5, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=6, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=6, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=7, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=7, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=8, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=8, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=9, p={12:0}] [L8] COND TRUE i < 10 [L9] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=0, alloca(10 * sizeof(char))={12:0}, i=9, p={12:0}] [L8] i++ VAL [alloca(10 * sizeof(char))={12:0}, i=10, p={12:0}] [L8] COND FALSE !(i < 10) VAL [alloca(10 * sizeof(char))={12:0}, i=10, p={12:0}] [L12] EXPR p[2] VAL [alloca(10 * sizeof(char))={12:0}, i=10, p={12:0}, p[2]=97] [L12] COND TRUE p[2] == 'a' [L13] free(p) VAL [alloca(10 * sizeof(char))={12:0}, i=10, p={12:0}] [L13] free(p) VAL [alloca(10 * sizeof(char))={12:0}, i=10, p={12:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 28 locations, 8 error locations. UNSAFE Result, 10.4s OverallTime, 16 OverallIterations, 10 TraceHistogramMax, 6.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 255 SDtfs, 235 SDslu, 660 SDs, 0 SdLazy, 351 SolverSat, 20 SolverUnsat, 12 SolverUnknown, 0 SolverNotchecked, 5.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 362 GetRequests, 285 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 15 MinimizatonAttempts, 36 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 665 NumberOfCodeBlocks, 650 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 590 ConstructedInterpolants, 1 QuantifiedInterpolants, 48915 SizeOfPredicates, 9 NumberOfNonLiveVariables, 930 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 24 InterpolantComputations, 7 PerfectInterpolantSequences, 9/1053 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...