./Ultimate.py --spec /storage/repos/svcomp/c/properties/valid-memsafety.prp --file /storage/repos/svcomp/c/memsafety-ext3/realloc1_false-valid-deref.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/realloc1_false-valid-deref.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 937cfa07aecfb3a07a3e6e685c2e5e481fbe44b8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref) --- Real Ultimate output --- This is Ultimate 0.1.24-0ed9222-m [2019-01-14 20:49:26,663 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-14 20:49:26,665 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-14 20:49:26,677 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-14 20:49:26,678 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-14 20:49:26,679 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-14 20:49:26,680 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-14 20:49:26,682 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-14 20:49:26,684 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-14 20:49:26,685 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-14 20:49:26,686 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-14 20:49:26,686 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-14 20:49:26,688 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-14 20:49:26,689 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-14 20:49:26,690 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-14 20:49:26,691 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-14 20:49:26,692 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-14 20:49:26,694 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-14 20:49:26,696 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-14 20:49:26,698 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-14 20:49:26,699 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-14 20:49:26,700 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-14 20:49:26,703 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-14 20:49:26,703 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-14 20:49:26,703 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-14 20:49:26,704 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-14 20:49:26,706 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-14 20:49:26,707 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-14 20:49:26,708 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-14 20:49:26,709 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-14 20:49:26,709 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-14 20:49:26,710 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-14 20:49:26,711 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-14 20:49:26,711 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-14 20:49:26,712 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-14 20:49:26,713 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-14 20:49:26,713 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2019-01-14 20:49:26,729 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-14 20:49:26,729 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-14 20:49:26,730 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-14 20:49:26,731 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-14 20:49:26,731 INFO L133 SettingsManager]: * Use SBE=true [2019-01-14 20:49:26,731 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-14 20:49:26,731 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-14 20:49:26,731 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-14 20:49:26,731 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-14 20:49:26,732 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-14 20:49:26,733 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-14 20:49:26,733 INFO L133 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-01-14 20:49:26,733 INFO L133 SettingsManager]: * Bitprecise bitfields=true [2019-01-14 20:49:26,733 INFO L133 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-01-14 20:49:26,733 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-14 20:49:26,734 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-14 20:49:26,734 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-14 20:49:26,734 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-14 20:49:26,734 INFO L133 SettingsManager]: * To the following directory=./dump/ [2019-01-14 20:49:26,734 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-14 20:49:26,734 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-14 20:49:26,736 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-14 20:49:26,736 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-14 20:49:26,736 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-14 20:49:26,736 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-14 20:49:26,737 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 -> 937cfa07aecfb3a07a3e6e685c2e5e481fbe44b8 [2019-01-14 20:49:26,773 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-14 20:49:26,789 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-14 20:49:26,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-14 20:49:26,794 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-14 20:49:26,794 INFO L276 PluginConnector]: CDTParser initialized [2019-01-14 20:49:26,795 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/memsafety-ext3/realloc1_false-valid-deref.c [2019-01-14 20:49:26,852 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/537ab6344/af164ce3de6e4872915bdc0f17f1f6e5/FLAGfde667362 [2019-01-14 20:49:27,243 INFO L307 CDTParser]: Found 1 translation units. [2019-01-14 20:49:27,244 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/memsafety-ext3/realloc1_false-valid-deref.c [2019-01-14 20:49:27,250 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/537ab6344/af164ce3de6e4872915bdc0f17f1f6e5/FLAGfde667362 [2019-01-14 20:49:27,612 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/537ab6344/af164ce3de6e4872915bdc0f17f1f6e5 [2019-01-14 20:49:27,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-14 20:49:27,617 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-01-14 20:49:27,619 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-14 20:49:27,619 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-14 20:49:27,623 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-14 20:49:27,624 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:49:27" (1/1) ... [2019-01-14 20:49:27,627 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@229aafd2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:27, skipping insertion in model container [2019-01-14 20:49:27,627 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.01 08:49:27" (1/1) ... [2019-01-14 20:49:27,636 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-14 20:49:27,657 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-14 20:49:27,896 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:49:27,920 INFO L191 MainTranslator]: Completed pre-run [2019-01-14 20:49:27,940 INFO L208 PostProcessor]: Analyzing one entry point: main [2019-01-14 20:49:27,956 INFO L195 MainTranslator]: Completed translation [2019-01-14 20:49:27,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:27 WrapperNode [2019-01-14 20:49:27,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-14 20:49:27,958 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-14 20:49:27,958 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-14 20:49:27,958 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-14 20:49:27,969 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:27" (1/1) ... [2019-01-14 20:49:27,969 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:27" (1/1) ... [2019-01-14 20:49:27,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:27" (1/1) ... [2019-01-14 20:49:27,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:27" (1/1) ... [2019-01-14 20:49:27,987 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:27" (1/1) ... [2019-01-14 20:49:27,992 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:27" (1/1) ... [2019-01-14 20:49:27,993 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:27" (1/1) ... [2019-01-14 20:49:27,995 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-14 20:49:27,996 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-14 20:49:27,997 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-14 20:49:27,997 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-14 20:49:27,998 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:27" (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 20:49:28,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-01-14 20:49:28,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-14 20:49:28,122 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-01-14 20:49:28,122 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_realloc [2019-01-14 20:49:28,122 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-01-14 20:49:28,122 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-01-14 20:49:28,122 INFO L130 BoogieDeclarations]: Found specification of procedure realloc [2019-01-14 20:49:28,122 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2019-01-14 20:49:28,122 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-01-14 20:49:28,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-01-14 20:49:28,123 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_realloc [2019-01-14 20:49:28,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-14 20:49:28,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-14 20:49:28,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-14 20:49:28,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-01-14 20:49:28,123 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-14 20:49:28,519 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-14 20:49:28,519 INFO L286 CfgBuilder]: Removed 1 assue(true) statements. [2019-01-14 20:49:28,520 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:49:28 BoogieIcfgContainer [2019-01-14 20:49:28,520 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-14 20:49:28,521 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-01-14 20:49:28,521 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-01-14 20:49:28,525 INFO L276 PluginConnector]: TraceAbstraction initialized [2019-01-14 20:49:28,525 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.01 08:49:27" (1/3) ... [2019-01-14 20:49:28,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9f8d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:49:28, skipping insertion in model container [2019-01-14 20:49:28,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.01 08:49:27" (2/3) ... [2019-01-14 20:49:28,526 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f9f8d24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.01 08:49:28, skipping insertion in model container [2019-01-14 20:49:28,526 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:49:28" (3/3) ... [2019-01-14 20:49:28,529 INFO L112 eAbstractionObserver]: Analyzing ICFG realloc1_false-valid-deref.c [2019-01-14 20:49:28,539 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-01-14 20:49:28,547 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-01-14 20:49:28,560 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-01-14 20:49:28,585 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-14 20:49:28,586 INFO L382 AbstractCegarLoop]: Interprodecural is true [2019-01-14 20:49:28,586 INFO L383 AbstractCegarLoop]: Hoare is false [2019-01-14 20:49:28,586 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-01-14 20:49:28,586 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-14 20:49:28,586 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-14 20:49:28,587 INFO L387 AbstractCegarLoop]: Difference is false [2019-01-14 20:49:28,587 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-14 20:49:28,587 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-01-14 20:49:28,604 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states. [2019-01-14 20:49:28,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 20:49:28,616 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:28,617 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:28,619 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 20:49:28,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:28,629 INFO L82 PathProgramCache]: Analyzing trace with hash 604141221, now seen corresponding path program 1 times [2019-01-14 20:49:28,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:28,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:28,680 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:28,681 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:28,681 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:28,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:28,790 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 20:49:28,792 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:28,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-01-14 20:49:28,796 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:49:28,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:49:28,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:28,810 INFO L87 Difference]: Start difference. First operand 33 states. Second operand 3 states. [2019-01-14 20:49:28,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:28,902 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2019-01-14 20:49:28,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:49:28,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 20:49:28,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:28,912 INFO L225 Difference]: With dead ends: 39 [2019-01-14 20:49:28,913 INFO L226 Difference]: Without dead ends: 36 [2019-01-14 20:49:28,915 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 20:49:28,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-01-14 20:49:28,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 31. [2019-01-14 20:49:28,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-01-14 20:49:28,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2019-01-14 20:49:28,946 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 8 [2019-01-14 20:49:28,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:28,947 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2019-01-14 20:49:28,947 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:49:28,947 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2019-01-14 20:49:28,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 20:49:28,948 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:28,948 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:28,948 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 20:49:28,949 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:28,949 INFO L82 PathProgramCache]: Analyzing trace with hash 604141275, now seen corresponding path program 1 times [2019-01-14 20:49:28,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:28,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:28,951 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:28,952 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:28,952 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:29,038 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 20:49:29,038 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:29,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:49:29,041 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:49:29,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:49:29,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:29,043 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand 3 states. [2019-01-14 20:49:29,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:29,273 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-01-14 20:49:29,274 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:49:29,274 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 20:49:29,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:29,275 INFO L225 Difference]: With dead ends: 32 [2019-01-14 20:49:29,275 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 20:49:29,276 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 20:49:29,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 20:49:29,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-01-14 20:49:29,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 20:49:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-01-14 20:49:29,281 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 8 [2019-01-14 20:49:29,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:29,281 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-01-14 20:49:29,281 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:49:29,281 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-01-14 20:49:29,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-01-14 20:49:29,282 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:29,283 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:29,283 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 20:49:29,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:29,283 INFO L82 PathProgramCache]: Analyzing trace with hash 604141276, now seen corresponding path program 1 times [2019-01-14 20:49:29,284 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:29,284 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:29,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:29,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:29,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:29,396 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 20:49:29,397 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:29,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:49:29,397 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:49:29,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:49:29,398 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:29,398 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 3 states. [2019-01-14 20:49:29,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:29,588 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2019-01-14 20:49:29,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:49:29,589 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-01-14 20:49:29,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:29,590 INFO L225 Difference]: With dead ends: 32 [2019-01-14 20:49:29,590 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 20:49:29,591 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 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 20:49:29,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 20:49:29,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2019-01-14 20:49:29,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 20:49:29,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-01-14 20:49:29,602 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 8 [2019-01-14 20:49:29,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:29,602 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-01-14 20:49:29,603 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:49:29,605 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-01-14 20:49:29,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 20:49:29,607 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:29,608 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:29,609 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 20:49:29,611 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:29,611 INFO L82 PathProgramCache]: Analyzing trace with hash -572402136, now seen corresponding path program 1 times [2019-01-14 20:49:29,611 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:29,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:29,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:29,615 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:29,615 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:29,698 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 20:49:29,700 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:29,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-01-14 20:49:29,700 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-01-14 20:49:29,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-01-14 20:49:29,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-01-14 20:49:29,701 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 3 states. [2019-01-14 20:49:29,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:29,748 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-01-14 20:49:29,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-01-14 20:49:29,749 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-01-14 20:49:29,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:29,751 INFO L225 Difference]: With dead ends: 32 [2019-01-14 20:49:29,751 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 20:49:29,751 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 20:49:29,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 20:49:29,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2019-01-14 20:49:29,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-01-14 20:49:29,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2019-01-14 20:49:29,756 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 12 [2019-01-14 20:49:29,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:29,757 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2019-01-14 20:49:29,757 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-01-14 20:49:29,758 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2019-01-14 20:49:29,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-01-14 20:49:29,758 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:29,758 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:29,759 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 20:49:29,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:29,760 INFO L82 PathProgramCache]: Analyzing trace with hash -572402081, now seen corresponding path program 1 times [2019-01-14 20:49:29,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:29,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:29,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:29,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:29,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:30,022 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 20:49:30,023 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-01-14 20:49:30,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-01-14 20:49:30,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:49:30,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:49:30,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:49:30,026 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand 6 states. [2019-01-14 20:49:30,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:30,281 INFO L93 Difference]: Finished difference Result 32 states and 33 transitions. [2019-01-14 20:49:30,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-01-14 20:49:30,282 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 12 [2019-01-14 20:49:30,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:30,285 INFO L225 Difference]: With dead ends: 32 [2019-01-14 20:49:30,285 INFO L226 Difference]: Without dead ends: 32 [2019-01-14 20:49:30,286 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:49:30,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-01-14 20:49:30,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2019-01-14 20:49:30,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-01-14 20:49:30,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2019-01-14 20:49:30,293 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 12 [2019-01-14 20:49:30,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:30,293 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2019-01-14 20:49:30,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:49:30,294 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2019-01-14 20:49:30,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-01-14 20:49:30,294 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:30,294 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:30,296 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 20:49:30,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:30,296 INFO L82 PathProgramCache]: Analyzing trace with hash -564596971, now seen corresponding path program 1 times [2019-01-14 20:49:30,297 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:30,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:30,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:30,298 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:30,298 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:30,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:30,358 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 20:49:30,359 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:30,359 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 20:49:30,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:30,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:30,396 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:30,436 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 20:49:30,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:30,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2019-01-14 20:49:30,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-01-14 20:49:30,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-01-14 20:49:30,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-01-14 20:49:30,459 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 5 states. [2019-01-14 20:49:30,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:30,496 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2019-01-14 20:49:30,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-01-14 20:49:30,498 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2019-01-14 20:49:30,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:30,499 INFO L225 Difference]: With dead ends: 33 [2019-01-14 20:49:30,499 INFO L226 Difference]: Without dead ends: 33 [2019-01-14 20:49:30,500 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 13 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 20:49:30,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-01-14 20:49:30,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-01-14 20:49:30,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-01-14 20:49:30,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2019-01-14 20:49:30,505 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 13 [2019-01-14 20:49:30,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:30,506 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2019-01-14 20:49:30,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-01-14 20:49:30,506 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2019-01-14 20:49:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-01-14 20:49:30,507 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:30,508 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:30,508 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 20:49:30,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:30,509 INFO L82 PathProgramCache]: Analyzing trace with hash 1942473074, now seen corresponding path program 2 times [2019-01-14 20:49:30,509 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:30,509 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:30,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:30,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:30,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:30,574 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 20:49:30,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:30,575 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 20:49:30,585 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:49:30,613 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2019-01-14 20:49:30,613 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:30,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:30,634 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 20:49:30,655 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-01-14 20:49:30,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2019-01-14 20:49:30,656 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-01-14 20:49:30,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-01-14 20:49:30,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-01-14 20:49:30,658 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand 6 states. [2019-01-14 20:49:30,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:30,998 INFO L93 Difference]: Finished difference Result 39 states and 40 transitions. [2019-01-14 20:49:31,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:49:31,002 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2019-01-14 20:49:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:31,002 INFO L225 Difference]: With dead ends: 39 [2019-01-14 20:49:31,003 INFO L226 Difference]: Without dead ends: 39 [2019-01-14 20:49:31,005 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:49:31,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2019-01-14 20:49:31,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 33. [2019-01-14 20:49:31,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2019-01-14 20:49:31,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 35 transitions. [2019-01-14 20:49:31,011 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 35 transitions. Word has length 17 [2019-01-14 20:49:31,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:31,011 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 35 transitions. [2019-01-14 20:49:31,011 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-01-14 20:49:31,012 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 35 transitions. [2019-01-14 20:49:31,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-01-14 20:49:31,017 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:31,017 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:31,017 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 20:49:31,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:31,018 INFO L82 PathProgramCache]: Analyzing trace with hash 838999410, now seen corresponding path program 1 times [2019-01-14 20:49:31,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:31,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:31,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:31,021 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:31,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:31,264 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 20:49:31,265 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:31,265 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 20:49:31,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:31,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:31,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:31,338 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 20:49:31,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:31,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 7 [2019-01-14 20:49:31,358 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-01-14 20:49:31,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-01-14 20:49:31,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-01-14 20:49:31,359 INFO L87 Difference]: Start difference. First operand 33 states and 35 transitions. Second operand 7 states. [2019-01-14 20:49:31,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:31,410 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2019-01-14 20:49:31,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-01-14 20:49:31,412 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2019-01-14 20:49:31,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:31,413 INFO L225 Difference]: With dead ends: 40 [2019-01-14 20:49:31,413 INFO L226 Difference]: Without dead ends: 40 [2019-01-14 20:49:31,414 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 20:49:31,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2019-01-14 20:49:31,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2019-01-14 20:49:31,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-01-14 20:49:31,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 39 transitions. [2019-01-14 20:49:31,419 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 39 transitions. Word has length 23 [2019-01-14 20:49:31,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:31,419 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 39 transitions. [2019-01-14 20:49:31,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-01-14 20:49:31,419 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 39 transitions. [2019-01-14 20:49:31,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-01-14 20:49:31,421 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:31,421 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:31,422 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 20:49:31,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:31,422 INFO L82 PathProgramCache]: Analyzing trace with hash 758998927, now seen corresponding path program 2 times [2019-01-14 20:49:31,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:31,422 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:31,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:31,425 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:31,425 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:31,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:31,660 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 20:49:31,661 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:31,661 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 20:49:31,678 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-01-14 20:49:31,724 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-01-14 20:49:31,724 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:31,727 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:31,824 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 20:49:31,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:31,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2019-01-14 20:49:31,854 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-01-14 20:49:31,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-01-14 20:49:31,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:49:31,856 INFO L87 Difference]: Start difference. First operand 37 states and 39 transitions. Second operand 8 states. [2019-01-14 20:49:31,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:31,916 INFO L93 Difference]: Finished difference Result 44 states and 46 transitions. [2019-01-14 20:49:31,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-01-14 20:49:31,917 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 27 [2019-01-14 20:49:31,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:31,918 INFO L225 Difference]: With dead ends: 44 [2019-01-14 20:49:31,918 INFO L226 Difference]: Without dead ends: 44 [2019-01-14 20:49:31,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-01-14 20:49:31,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-01-14 20:49:31,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2019-01-14 20:49:31,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-01-14 20:49:31,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 43 transitions. [2019-01-14 20:49:31,925 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 43 transitions. Word has length 27 [2019-01-14 20:49:31,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:31,926 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 43 transitions. [2019-01-14 20:49:31,926 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-01-14 20:49:31,926 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 43 transitions. [2019-01-14 20:49:31,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-01-14 20:49:31,928 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:31,928 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:31,928 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 20:49:31,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:31,929 INFO L82 PathProgramCache]: Analyzing trace with hash 660364076, now seen corresponding path program 3 times [2019-01-14 20:49:31,929 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:31,929 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:31,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:31,931 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:31,931 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:32,074 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 20:49:32,074 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:32,075 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 20:49:32,086 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2019-01-14 20:49:32,142 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2019-01-14 20:49:32,142 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:32,146 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:32,168 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 20:49:32,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:32,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 9 [2019-01-14 20:49:32,188 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-01-14 20:49:32,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-01-14 20:49:32,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-01-14 20:49:32,189 INFO L87 Difference]: Start difference. First operand 41 states and 43 transitions. Second operand 9 states. [2019-01-14 20:49:32,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:32,254 INFO L93 Difference]: Finished difference Result 48 states and 50 transitions. [2019-01-14 20:49:32,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-01-14 20:49:32,255 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2019-01-14 20:49:32,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:32,256 INFO L225 Difference]: With dead ends: 48 [2019-01-14 20:49:32,256 INFO L226 Difference]: Without dead ends: 48 [2019-01-14 20:49:32,257 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 20:49:32,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2019-01-14 20:49:32,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2019-01-14 20:49:32,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-01-14 20:49:32,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2019-01-14 20:49:32,263 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 31 [2019-01-14 20:49:32,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:32,264 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2019-01-14 20:49:32,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-01-14 20:49:32,264 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2019-01-14 20:49:32,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-01-14 20:49:32,265 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:32,265 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:32,265 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 20:49:32,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:32,268 INFO L82 PathProgramCache]: Analyzing trace with hash 1265514569, now seen corresponding path program 4 times [2019-01-14 20:49:32,268 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:32,268 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:32,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:32,270 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:32,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:32,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:32,392 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 20:49:32,392 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:32,392 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 20:49:32,412 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2019-01-14 20:49:32,457 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2019-01-14 20:49:32,457 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:32,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:32,483 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 20:49:32,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:32,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 10 [2019-01-14 20:49:32,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-01-14 20:49:32,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-01-14 20:49:32,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:49:32,513 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand 10 states. [2019-01-14 20:49:32,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:32,670 INFO L93 Difference]: Finished difference Result 52 states and 54 transitions. [2019-01-14 20:49:32,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-01-14 20:49:32,671 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2019-01-14 20:49:32,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:32,672 INFO L225 Difference]: With dead ends: 52 [2019-01-14 20:49:32,673 INFO L226 Difference]: Without dead ends: 52 [2019-01-14 20:49:32,673 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-01-14 20:49:32,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-01-14 20:49:32,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 49. [2019-01-14 20:49:32,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-01-14 20:49:32,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 51 transitions. [2019-01-14 20:49:32,681 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 51 transitions. Word has length 35 [2019-01-14 20:49:32,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:32,681 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 51 transitions. [2019-01-14 20:49:32,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-01-14 20:49:32,681 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 51 transitions. [2019-01-14 20:49:32,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-01-14 20:49:32,684 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:32,684 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:32,685 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 20:49:32,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:32,686 INFO L82 PathProgramCache]: Analyzing trace with hash 719470310, now seen corresponding path program 5 times [2019-01-14 20:49:32,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:32,686 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:32,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:32,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:32,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:32,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:32,804 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 20:49:32,805 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:32,805 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 20:49:32,817 INFO L103 rtionOrderModulation]: Keeping assertion order INSIDE_LOOP_FIRST1 [2019-01-14 20:49:32,945 INFO L249 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 8 check-sat command(s) [2019-01-14 20:49:32,945 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:32,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:33,045 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 20:49:33,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:33,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 11 [2019-01-14 20:49:33,077 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-01-14 20:49:33,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-01-14 20:49:33,078 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:49:33,078 INFO L87 Difference]: Start difference. First operand 49 states and 51 transitions. Second operand 11 states. [2019-01-14 20:49:33,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:33,315 INFO L93 Difference]: Finished difference Result 56 states and 58 transitions. [2019-01-14 20:49:33,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-01-14 20:49:33,316 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 39 [2019-01-14 20:49:33,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:33,317 INFO L225 Difference]: With dead ends: 56 [2019-01-14 20:49:33,317 INFO L226 Difference]: Without dead ends: 56 [2019-01-14 20:49:33,318 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-01-14 20:49:33,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-01-14 20:49:33,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 53. [2019-01-14 20:49:33,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-01-14 20:49:33,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2019-01-14 20:49:33,323 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 39 [2019-01-14 20:49:33,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:33,324 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2019-01-14 20:49:33,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-01-14 20:49:33,324 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2019-01-14 20:49:33,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-01-14 20:49:33,327 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:33,327 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:33,327 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 20:49:33,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:33,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1920487677, now seen corresponding path program 6 times [2019-01-14 20:49:33,328 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:33,328 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:33,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:33,329 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:33,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:33,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:33,965 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 20:49:33,965 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:33,965 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 20:49:33,975 INFO L103 rtionOrderModulation]: Keeping assertion order MIX_INSIDE_OUTSIDE [2019-01-14 20:49:34,034 INFO L249 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2019-01-14 20:49:34,035 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-01-14 20:49:34,039 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:34,064 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 20:49:34,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:34,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2019-01-14 20:49:34,085 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-01-14 20:49:34,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-01-14 20:49:34,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:49:34,086 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand 12 states. [2019-01-14 20:49:34,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:34,177 INFO L93 Difference]: Finished difference Result 60 states and 62 transitions. [2019-01-14 20:49:34,178 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-01-14 20:49:34,178 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 43 [2019-01-14 20:49:34,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:34,180 INFO L225 Difference]: With dead ends: 60 [2019-01-14 20:49:34,180 INFO L226 Difference]: Without dead ends: 60 [2019-01-14 20:49:34,180 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-01-14 20:49:34,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-01-14 20:49:34,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2019-01-14 20:49:34,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2019-01-14 20:49:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2019-01-14 20:49:34,186 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 43 [2019-01-14 20:49:34,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:34,186 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2019-01-14 20:49:34,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-01-14 20:49:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2019-01-14 20:49:34,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-01-14 20:49:34,189 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:34,189 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:34,189 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 20:49:34,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:34,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1099810976, now seen corresponding path program 7 times [2019-01-14 20:49:34,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:34,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:34,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:34,193 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-01-14 20:49:34,193 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:34,598 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 20:49:34,599 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-01-14 20:49:34,599 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 20:49:34,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:34,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-14 20:49:34,630 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-14 20:49:34,648 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 20:49:34,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-01-14 20:49:34,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 13 [2019-01-14 20:49:34,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-01-14 20:49:34,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-01-14 20:49:34,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:49:34,669 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand 13 states. [2019-01-14 20:49:34,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-01-14 20:49:34,739 INFO L93 Difference]: Finished difference Result 61 states and 63 transitions. [2019-01-14 20:49:34,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-01-14 20:49:34,740 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 47 [2019-01-14 20:49:34,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-01-14 20:49:34,742 INFO L225 Difference]: With dead ends: 61 [2019-01-14 20:49:34,742 INFO L226 Difference]: Without dead ends: 61 [2019-01-14 20:49:34,742 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-01-14 20:49:34,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-01-14 20:49:34,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-01-14 20:49:34,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-01-14 20:49:34,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 63 transitions. [2019-01-14 20:49:34,748 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 63 transitions. Word has length 47 [2019-01-14 20:49:34,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-01-14 20:49:34,749 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 63 transitions. [2019-01-14 20:49:34,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-01-14 20:49:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 63 transitions. [2019-01-14 20:49:34,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-01-14 20:49:34,750 INFO L394 BasicCegarLoop]: Found error trace [2019-01-14 20:49:34,750 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-01-14 20:49:34,751 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONMEMORY_FREE, mainErr6REQUIRES_VIOLATION, mainErr7ENSURES_VIOLATIONMEMORY_LEAK, mainErr0REQUIRES_VIOLATION, mainErr4ASSERT_VIOLATIONMEMORY_FREE, mainErr5REQUIRES_VIOLATION, mainErr3ASSERT_VIOLATIONMEMORY_FREE, mainErr1REQUIRES_VIOLATION]=== [2019-01-14 20:49:34,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-14 20:49:34,752 INFO L82 PathProgramCache]: Analyzing trace with hash -343684163, now seen corresponding path program 8 times [2019-01-14 20:49:34,753 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-14 20:49:34,753 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-14 20:49:34,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:34,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-14 20:49:34,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-14 20:49:34,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 20:49:34,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-14 20:49:34,855 INFO L469 BasicCegarLoop]: Counterexample might be feasible [2019-01-14 20:49:34,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.01 08:49:34 BoogieIcfgContainer [2019-01-14 20:49:34,901 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-01-14 20:49:34,901 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-14 20:49:34,901 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-14 20:49:34,902 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-14 20:49:34,904 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.01 08:49:28" (3/4) ... [2019-01-14 20:49:34,907 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample [2019-01-14 20:49:34,967 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2019-01-14 20:49:34,967 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-14 20:49:34,968 INFO L168 Benchmark]: Toolchain (without parser) took 7351.86 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 205.5 MB). Free memory was 954.0 MB in the beginning and 1.1 GB in the end (delta: -185.9 MB). Peak memory consumption was 19.6 MB. Max. memory is 11.5 GB. [2019-01-14 20:49:34,971 INFO L168 Benchmark]: CDTParser took 0.15 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 20:49:34,971 INFO L168 Benchmark]: CACSL2BoogieTranslator took 338.76 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 943.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2019-01-14 20:49:34,972 INFO L168 Benchmark]: Boogie Preprocessor took 38.32 ms. Allocated memory is still 1.0 GB. Free memory is still 943.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 20:49:34,972 INFO L168 Benchmark]: RCFGBuilder took 524.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2019-01-14 20:49:34,973 INFO L168 Benchmark]: TraceAbstraction took 6379.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -33.7 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. [2019-01-14 20:49:34,974 INFO L168 Benchmark]: Witness Printer took 65.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-14 20:49:34,979 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.15 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 338.76 ms. Allocated memory is still 1.0 GB. Free memory was 954.0 MB in the beginning and 943.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 38.32 ms. Allocated memory is still 1.0 GB. Free memory is still 943.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 524.16 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 943.3 MB in the beginning and 1.1 GB in the end (delta: -169.6 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6379.65 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 62.9 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -33.7 MB). Peak memory consumption was 29.2 MB. Max. memory is 11.5 GB. * Witness Printer took 65.78 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 16]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L8] char* p = malloc(10 * sizeof(int)); [L10] int i = 0; VAL [i=0, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=0, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] i++ VAL [i=1, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=1, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] i++ VAL [i=2, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=2, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] i++ VAL [i=3, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=3, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] i++ VAL [i=4, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=4, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] i++ VAL [i=5, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=5, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] i++ VAL [i=6, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=6, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] i++ VAL [i=7, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=7, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] i++ VAL [i=8, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=8, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] i++ VAL [i=9, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] COND TRUE i < 10 [L11] p[i] = __VERIFIER_nondet_char() VAL [__VERIFIER_nondet_char()=1, i=9, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] i++ VAL [i=10, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L10] COND FALSE !(i < 10) VAL [i=10, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L14] free(p) VAL [i=10, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L14] free(p) VAL [i=10, malloc(10 * sizeof(int))={-2:0}, p={-2:0}] [L14] free(p) [L16] p[2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 33 locations, 8 error locations. UNSAFE Result, 6.3s OverallTime, 15 OverallIterations, 10 TraceHistogramMax, 2.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 328 SDtfs, 243 SDslu, 906 SDs, 0 SdLazy, 335 SolverSat, 20 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 356 GetRequests, 281 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=14, 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, 14 MinimizatonAttempts, 46 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 649 NumberOfCodeBlocks, 641 NumberOfCodeBlocksAsserted, 46 NumberOfCheckSat, 575 ConstructedInterpolants, 0 QuantifiedInterpolants, 46230 SizeOfPredicates, 9 NumberOfNonLiveVariables, 899 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 23 InterpolantComputations, 6 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...