./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety/test-0019-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0019-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9fb1ca01555f439b860fec974f930b68e3dc780 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety/test-0019-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a9fb1ca01555f439b860fec974f930b68e3dc780 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-07 15:51:25,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:51:25,583 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:51:25,591 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:51:25,592 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:51:25,592 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:51:25,593 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:51:25,595 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:51:25,596 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:51:25,597 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:51:25,597 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:51:25,598 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:51:25,599 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:51:25,599 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:51:25,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:51:25,601 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:51:25,602 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:51:25,602 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:51:25,604 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:51:25,605 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:51:25,606 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:51:25,607 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:51:25,608 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:51:25,608 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:51:25,610 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:51:25,610 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:51:25,611 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:51:25,611 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:51:25,612 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:51:25,612 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:51:25,613 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:51:25,613 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:51:25,614 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:51:25,614 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:51:25,615 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:51:25,615 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:51:25,615 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:51:25,615 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:51:25,615 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:51:25,616 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:51:25,617 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:51:25,617 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Default.epf [2019-12-07 15:51:25,628 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:51:25,629 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:51:25,629 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 15:51:25,629 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 15:51:25,629 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 15:51:25,629 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 15:51:25,630 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-12-07 15:51:25,630 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 15:51:25,630 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 15:51:25,630 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-12-07 15:51:25,630 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2019-12-07 15:51:25,630 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 15:51:25,631 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2019-12-07 15:51:25,631 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2019-12-07 15:51:25,631 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2019-12-07 15:51:25,631 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:51:25,631 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:51:25,632 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:51:25,632 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:51:25,632 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 15:51:25,632 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:51:25,632 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:51:25,632 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:51:25,632 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 15:51:25,633 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 15:51:25,633 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 15:51:25,633 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:51:25,633 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 15:51:25,633 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:51:25,633 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:51:25,633 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:51:25,633 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:51:25,634 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:51:25,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:51:25,634 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:51:25,634 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:51:25,634 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2019-12-07 15:51:25,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-07 15:51:25,634 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:51:25,634 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 15:51:25,635 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan 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 -> Taipan 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 -> a9fb1ca01555f439b860fec974f930b68e3dc780 [2019-12-07 15:51:25,749 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:51:25,757 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:51:25,759 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:51:25,760 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:51:25,760 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:51:25,761 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/../../sv-benchmarks/c/memsafety/test-0019-2.i [2019-12-07 15:51:25,799 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/data/8663d1f4d/14379df0ed1a40ccacecd8893a9c14cb/FLAG7c252380e [2019-12-07 15:51:26,251 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:51:26,251 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/sv-benchmarks/c/memsafety/test-0019-2.i [2019-12-07 15:51:26,262 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/data/8663d1f4d/14379df0ed1a40ccacecd8893a9c14cb/FLAG7c252380e [2019-12-07 15:51:26,270 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/data/8663d1f4d/14379df0ed1a40ccacecd8893a9c14cb [2019-12-07 15:51:26,272 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:51:26,273 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:51:26,274 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:51:26,274 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:51:26,277 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:51:26,277 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:51:26" (1/1) ... [2019-12-07 15:51:26,279 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@21dd141f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:26, skipping insertion in model container [2019-12-07 15:51:26,279 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:51:26" (1/1) ... [2019-12-07 15:51:26,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:51:26,309 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:51:26,501 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:51:26,507 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:51:26,532 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:51:26,566 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:51:26,566 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:26 WrapperNode [2019-12-07 15:51:26,566 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:51:26,567 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:51:26,567 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:51:26,567 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:51:26,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:26" (1/1) ... [2019-12-07 15:51:26,582 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:26" (1/1) ... [2019-12-07 15:51:26,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:51:26,596 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:51:26,596 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:51:26,596 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:51:26,602 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:26" (1/1) ... [2019-12-07 15:51:26,602 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:26" (1/1) ... [2019-12-07 15:51:26,604 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:26" (1/1) ... [2019-12-07 15:51:26,604 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:26" (1/1) ... [2019-12-07 15:51:26,609 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:26" (1/1) ... [2019-12-07 15:51:26,610 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:26" (1/1) ... [2019-12-07 15:51:26,612 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:26" (1/1) ... [2019-12-07 15:51:26,613 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:51:26,613 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:51:26,613 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:51:26,614 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:51:26,614 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:26" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/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-12-07 15:51:26,652 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 15:51:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:51:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 15:51:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 15:51:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:51:26,653 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:51:26,653 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:51:26,873 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:51:26,873 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 15:51:26,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:51:26 BoogieIcfgContainer [2019-12-07 15:51:26,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:51:26,874 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:51:26,874 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:51:26,876 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:51:26,876 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:51:26" (1/3) ... [2019-12-07 15:51:26,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7f5386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:51:26, skipping insertion in model container [2019-12-07 15:51:26,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:26" (2/3) ... [2019-12-07 15:51:26,877 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a7f5386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:51:26, skipping insertion in model container [2019-12-07 15:51:26,877 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:51:26" (3/3) ... [2019-12-07 15:51:26,878 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2019-12-07 15:51:26,884 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:51:26,889 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-12-07 15:51:26,896 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-12-07 15:51:26,908 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:51:26,908 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 15:51:26,908 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:51:26,908 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:51:26,908 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:51:26,908 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:51:26,908 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:51:26,908 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:51:26,918 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2019-12-07 15:51:26,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 15:51:26,923 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:51:26,923 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 15:51:26,924 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:51:26,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:51:26,927 INFO L82 PathProgramCache]: Analyzing trace with hash 2515, now seen corresponding path program 1 times [2019-12-07 15:51:26,933 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:51:26,933 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833423671] [2019-12-07 15:51:26,933 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:51:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:51:27,037 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:27,037 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833423671] [2019-12-07 15:51:27,038 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:51:27,038 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:51:27,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167426057] [2019-12-07 15:51:27,042 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:51:27,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:51:27,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:51:27,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:51:27,053 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 3 states. [2019-12-07 15:51:27,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:51:27,097 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2019-12-07 15:51:27,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:51:27,099 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 15:51:27,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:51:27,107 INFO L225 Difference]: With dead ends: 39 [2019-12-07 15:51:27,107 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 15:51:27,108 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 15:51:27,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 15:51:27,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 32. [2019-12-07 15:51:27,131 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-12-07 15:51:27,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2019-12-07 15:51:27,132 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 2 [2019-12-07 15:51:27,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:51:27,133 INFO L462 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2019-12-07 15:51:27,133 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:51:27,133 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2019-12-07 15:51:27,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-12-07 15:51:27,133 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:51:27,133 INFO L410 BasicCegarLoop]: trace histogram [1, 1] [2019-12-07 15:51:27,133 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:51:27,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:51:27,134 INFO L82 PathProgramCache]: Analyzing trace with hash 2516, now seen corresponding path program 1 times [2019-12-07 15:51:27,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:51:27,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655626672] [2019-12-07 15:51:27,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:51:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:51:27,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:27,167 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655626672] [2019-12-07 15:51:27,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:51:27,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-07 15:51:27,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252330724] [2019-12-07 15:51:27,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:51:27,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:51:27,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:51:27,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:51:27,169 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 3 states. [2019-12-07 15:51:27,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:51:27,186 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-12-07 15:51:27,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:51:27,186 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-12-07 15:51:27,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:51:27,187 INFO L225 Difference]: With dead ends: 30 [2019-12-07 15:51:27,187 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 15:51:27,188 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-07 15:51:27,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 15:51:27,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-07 15:51:27,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 15:51:27,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-12-07 15:51:27,191 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 2 [2019-12-07 15:51:27,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:51:27,191 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-12-07 15:51:27,191 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:51:27,191 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-12-07 15:51:27,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 15:51:27,191 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:51:27,191 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 15:51:27,192 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:51:27,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:51:27,192 INFO L82 PathProgramCache]: Analyzing trace with hash 2467551, now seen corresponding path program 1 times [2019-12-07 15:51:27,192 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:51:27,192 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [912060926] [2019-12-07 15:51:27,192 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:51:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:51:27,219 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:27,219 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [912060926] [2019-12-07 15:51:27,219 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:51:27,220 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:51:27,220 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245144180] [2019-12-07 15:51:27,220 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:51:27,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:51:27,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:51:27,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:51:27,220 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 4 states. [2019-12-07 15:51:27,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:51:27,258 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-12-07 15:51:27,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:51:27,259 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-07 15:51:27,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:51:27,259 INFO L225 Difference]: With dead ends: 29 [2019-12-07 15:51:27,259 INFO L226 Difference]: Without dead ends: 29 [2019-12-07 15:51:27,260 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:51:27,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-12-07 15:51:27,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2019-12-07 15:51:27,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 15:51:27,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2019-12-07 15:51:27,263 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 4 [2019-12-07 15:51:27,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:51:27,263 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2019-12-07 15:51:27,263 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:51:27,263 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2019-12-07 15:51:27,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-12-07 15:51:27,263 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:51:27,263 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-12-07 15:51:27,264 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:51:27,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:51:27,264 INFO L82 PathProgramCache]: Analyzing trace with hash 2467552, now seen corresponding path program 1 times [2019-12-07 15:51:27,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:51:27,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004541960] [2019-12-07 15:51:27,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:51:27,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:51:27,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:27,298 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004541960] [2019-12-07 15:51:27,298 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:51:27,298 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-07 15:51:27,298 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156731417] [2019-12-07 15:51:27,299 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:51:27,299 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:51:27,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:51:27,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:51:27,299 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 4 states. [2019-12-07 15:51:27,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:51:27,324 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-12-07 15:51:27,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:51:27,324 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-12-07 15:51:27,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:51:27,324 INFO L225 Difference]: With dead ends: 24 [2019-12-07 15:51:27,324 INFO L226 Difference]: Without dead ends: 24 [2019-12-07 15:51:27,325 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:51:27,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-12-07 15:51:27,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-12-07 15:51:27,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-12-07 15:51:27,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-12-07 15:51:27,327 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 4 [2019-12-07 15:51:27,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:51:27,327 INFO L462 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-12-07 15:51:27,327 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:51:27,327 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-12-07 15:51:27,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 15:51:27,327 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:51:27,328 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:51:27,328 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:51:27,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:51:27,328 INFO L82 PathProgramCache]: Analyzing trace with hash 497700460, now seen corresponding path program 1 times [2019-12-07 15:51:27,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:51:27,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899377901] [2019-12-07 15:51:27,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:51:27,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:51:27,380 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:27,380 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899377901] [2019-12-07 15:51:27,380 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:51:27,380 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:51:27,381 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292254144] [2019-12-07 15:51:27,381 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:51:27,381 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:51:27,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:51:27,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:51:27,382 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 6 states. [2019-12-07 15:51:27,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:51:27,444 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-12-07 15:51:27,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-07 15:51:27,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-12-07 15:51:27,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:51:27,445 INFO L225 Difference]: With dead ends: 23 [2019-12-07 15:51:27,445 INFO L226 Difference]: Without dead ends: 23 [2019-12-07 15:51:27,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:51:27,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-12-07 15:51:27,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-12-07 15:51:27,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-12-07 15:51:27,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-12-07 15:51:27,449 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 7 [2019-12-07 15:51:27,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:51:27,449 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-12-07 15:51:27,449 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:51:27,449 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-12-07 15:51:27,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-12-07 15:51:27,450 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:51:27,450 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:51:27,450 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:51:27,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:51:27,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1751154868, now seen corresponding path program 1 times [2019-12-07 15:51:27,451 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:51:27,451 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107840721] [2019-12-07 15:51:27,451 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:51:27,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:51:27,510 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:27,511 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107840721] [2019-12-07 15:51:27,511 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:51:27,511 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-07 15:51:27,511 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713854062] [2019-12-07 15:51:27,511 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-07 15:51:27,512 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2019-12-07 15:51:27,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-07 15:51:27,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-07 15:51:27,512 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 6 states. [2019-12-07 15:51:27,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:51:27,582 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-12-07 15:51:27,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-07 15:51:27,582 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-12-07 15:51:27,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:51:27,583 INFO L225 Difference]: With dead ends: 22 [2019-12-07 15:51:27,583 INFO L226 Difference]: Without dead ends: 22 [2019-12-07 15:51:27,583 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:51:27,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-12-07 15:51:27,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-12-07 15:51:27,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-12-07 15:51:27,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-12-07 15:51:27,585 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 8 [2019-12-07 15:51:27,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:51:27,585 INFO L462 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-12-07 15:51:27,585 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-07 15:51:27,585 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-12-07 15:51:27,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-07 15:51:27,586 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:51:27,586 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:51:27,586 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:51:27,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:51:27,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1549205321, now seen corresponding path program 1 times [2019-12-07 15:51:27,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2019-12-07 15:51:27,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250532137] [2019-12-07 15:51:27,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-07 15:51:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:51:27,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:51:27,638 INFO L174 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2019-12-07 15:51:27,638 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:51:27,659 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:51:27 BoogieIcfgContainer [2019-12-07 15:51:27,659 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:51:27,659 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:51:27,659 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:51:27,659 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:51:27,660 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:51:26" (3/4) ... [2019-12-07 15:51:27,662 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 15:51:27,662 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:51:27,663 INFO L168 Benchmark]: Toolchain (without parser) took 1389.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 938.1 MB in the beginning and 968.1 MB in the end (delta: -30.1 MB). Peak memory consumption was 103.6 MB. Max. memory is 11.5 GB. [2019-12-07 15:51:27,664 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:51:27,664 INFO L168 Benchmark]: CACSL2BoogieTranslator took 292.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. [2019-12-07 15:51:27,664 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.09 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-12-07 15:51:27,665 INFO L168 Benchmark]: Boogie Preprocessor took 17.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-12-07 15:51:27,665 INFO L168 Benchmark]: RCFGBuilder took 260.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2019-12-07 15:51:27,665 INFO L168 Benchmark]: TraceAbstraction took 784.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 968.1 MB in the end (delta: 115.0 MB). Peak memory consumption was 115.0 MB. Max. memory is 11.5 GB. [2019-12-07 15:51:27,666 INFO L168 Benchmark]: Witness Printer took 2.78 ms. Allocated memory is still 1.2 GB. Free memory is still 968.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:51:27,668 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 960.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 292.63 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 133.7 MB). Free memory was 938.1 MB in the beginning and 1.1 GB in the end (delta: -179.6 MB). Peak memory consumption was 18.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.09 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. * Boogie Preprocessor took 17.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 260.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 29.1 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * TraceAbstraction took 784.71 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 968.1 MB in the end (delta: 115.0 MB). Peak memory consumption was 115.0 MB. Max. memory is 11.5 GB. * Witness Printer took 2.78 ms. Allocated memory is still 1.2 GB. Free memory is still 968.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 532]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 532. Possible FailurePath: [L533] TData data; [L518] pdata->lo = malloc(16) [L519] pdata->hi = malloc(24) [L523] EXPR data->lo [L523] void *lo = data->lo; [L524] EXPR data->hi [L524] void *hi = data->hi; [L525] COND FALSE !(lo == hi) [L529] data->lo = (void *) 0 [L530] data->hi = (void *) 0 [L536] return 0; [L536] return 0; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 35 locations, 19 error locations. Result: UNSAFE, OverallTime: 0.7s, OverallIterations: 7, TraceHistogramMax: 1, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 89 SDtfs, 247 SDslu, 19 SDs, 0 SdLazy, 106 SolverSat, 26 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=35occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 7 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 36 NumberOfCodeBlocks, 36 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 21 ConstructedInterpolants, 0 QuantifiedInterpolants, 838 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-07 15:51:29,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-07 15:51:29,069 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-07 15:51:29,077 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-07 15:51:29,077 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-07 15:51:29,078 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-07 15:51:29,079 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-07 15:51:29,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-07 15:51:29,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-07 15:51:29,082 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-07 15:51:29,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-07 15:51:29,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-07 15:51:29,084 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-07 15:51:29,084 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-07 15:51:29,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-07 15:51:29,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-07 15:51:29,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-07 15:51:29,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-07 15:51:29,089 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-07 15:51:29,090 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-07 15:51:29,091 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-07 15:51:29,092 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-07 15:51:29,093 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-07 15:51:29,094 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-07 15:51:29,096 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-07 15:51:29,096 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-07 15:51:29,096 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-07 15:51:29,097 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-07 15:51:29,097 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-07 15:51:29,098 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-07 15:51:29,098 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-07 15:51:29,098 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-07 15:51:29,099 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-07 15:51:29,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-07 15:51:29,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-07 15:51:29,100 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-07 15:51:29,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-07 15:51:29,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-07 15:51:29,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-07 15:51:29,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-07 15:51:29,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-07 15:51:29,103 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/config/svcomp-DerefFreeMemtrack-32bit-Taipan_Bitvector.epf [2019-12-07 15:51:29,113 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-07 15:51:29,113 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-07 15:51:29,114 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-07 15:51:29,114 INFO L138 SettingsManager]: * User list type=DISABLED [2019-12-07 15:51:29,114 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-12-07 15:51:29,114 INFO L138 SettingsManager]: * Explicit value domain=true [2019-12-07 15:51:29,114 INFO L138 SettingsManager]: * Octagon Domain=false [2019-12-07 15:51:29,114 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-12-07 15:51:29,114 INFO L138 SettingsManager]: * Interval Domain=false [2019-12-07 15:51:29,115 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-07 15:51:29,115 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-07 15:51:29,115 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-07 15:51:29,115 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-07 15:51:29,115 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-12-07 15:51:29,116 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-07 15:51:29,116 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-07 15:51:29,116 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-07 15:51:29,116 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2019-12-07 15:51:29,116 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2019-12-07 15:51:29,116 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2019-12-07 15:51:29,116 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-07 15:51:29,117 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-07 15:51:29,117 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-07 15:51:29,117 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-07 15:51:29,117 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-07 15:51:29,117 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-07 15:51:29,117 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-07 15:51:29,117 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-07 15:51:29,118 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-07 15:51:29,118 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-07 15:51:29,118 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-07 15:51:29,118 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-07 15:51:29,118 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-07 15:51:29,118 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-07 15:51:29,118 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-07 15:51:29,119 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-07 15:51:29,119 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-07 15:51:29,119 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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 -> /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan 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 -> Taipan 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 -> a9fb1ca01555f439b860fec974f930b68e3dc780 [2019-12-07 15:51:29,293 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-07 15:51:29,303 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-07 15:51:29,305 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-07 15:51:29,306 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-07 15:51:29,306 INFO L275 PluginConnector]: CDTParser initialized [2019-12-07 15:51:29,307 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/../../sv-benchmarks/c/memsafety/test-0019-2.i [2019-12-07 15:51:29,353 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/data/a590f1c6e/d76214a2f65d45e49b482eecffadd61c/FLAG78658ee44 [2019-12-07 15:51:29,776 INFO L306 CDTParser]: Found 1 translation units. [2019-12-07 15:51:29,776 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/sv-benchmarks/c/memsafety/test-0019-2.i [2019-12-07 15:51:29,786 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/data/a590f1c6e/d76214a2f65d45e49b482eecffadd61c/FLAG78658ee44 [2019-12-07 15:51:30,131 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/data/a590f1c6e/d76214a2f65d45e49b482eecffadd61c [2019-12-07 15:51:30,134 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-07 15:51:30,135 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-07 15:51:30,135 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-07 15:51:30,135 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-07 15:51:30,137 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-07 15:51:30,138 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:51:30" (1/1) ... [2019-12-07 15:51:30,140 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@696fdb0d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:30, skipping insertion in model container [2019-12-07 15:51:30,140 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.12 03:51:30" (1/1) ... [2019-12-07 15:51:30,144 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-07 15:51:30,168 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-07 15:51:30,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:51:30,339 INFO L203 MainTranslator]: Completed pre-run [2019-12-07 15:51:30,398 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-07 15:51:30,432 INFO L208 MainTranslator]: Completed translation [2019-12-07 15:51:30,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:30 WrapperNode [2019-12-07 15:51:30,433 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-07 15:51:30,433 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-07 15:51:30,433 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-07 15:51:30,433 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-07 15:51:30,439 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:30" (1/1) ... [2019-12-07 15:51:30,450 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:30" (1/1) ... [2019-12-07 15:51:30,463 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-07 15:51:30,463 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-07 15:51:30,463 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-07 15:51:30,463 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-07 15:51:30,469 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:30" (1/1) ... [2019-12-07 15:51:30,469 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:30" (1/1) ... [2019-12-07 15:51:30,471 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:30" (1/1) ... [2019-12-07 15:51:30,472 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:30" (1/1) ... [2019-12-07 15:51:30,477 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:30" (1/1) ... [2019-12-07 15:51:30,479 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:30" (1/1) ... [2019-12-07 15:51:30,480 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:30" (1/1) ... [2019-12-07 15:51:30,482 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-07 15:51:30,482 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-07 15:51:30,482 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-07 15:51:30,482 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-07 15:51:30,483 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/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-12-07 15:51:30,521 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-07 15:51:30,522 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-07 15:51:30,522 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-07 15:51:30,522 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-07 15:51:30,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-07 15:51:30,522 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-07 15:51:30,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-07 15:51:30,741 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-07 15:51:30,741 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-07 15:51:30,742 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:51:30 BoogieIcfgContainer [2019-12-07 15:51:30,742 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-07 15:51:30,743 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-07 15:51:30,743 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-07 15:51:30,745 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-07 15:51:30,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.12 03:51:30" (1/3) ... [2019-12-07 15:51:30,745 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73877af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:51:30, skipping insertion in model container [2019-12-07 15:51:30,745 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.12 03:51:30" (2/3) ... [2019-12-07 15:51:30,746 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73877af0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.12 03:51:30, skipping insertion in model container [2019-12-07 15:51:30,746 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:51:30" (3/3) ... [2019-12-07 15:51:30,747 INFO L109 eAbstractionObserver]: Analyzing ICFG test-0019-2.i [2019-12-07 15:51:30,753 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-07 15:51:30,757 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 19 error locations. [2019-12-07 15:51:30,764 INFO L249 AbstractCegarLoop]: Starting to check reachability of 19 error locations. [2019-12-07 15:51:30,776 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-07 15:51:30,776 INFO L374 AbstractCegarLoop]: Hoare is false [2019-12-07 15:51:30,776 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-07 15:51:30,776 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-07 15:51:30,776 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-07 15:51:30,776 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-07 15:51:30,776 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-07 15:51:30,776 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-07 15:51:30,787 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states. [2019-12-07 15:51:30,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 15:51:30,791 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:51:30,792 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 15:51:30,792 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:51:30,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:51:30,796 INFO L82 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2019-12-07 15:51:30,803 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:51:30,803 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [497063465] [2019-12-07 15:51:30,803 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/mathsat Starting monitored process 2 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with mathsat -unsat_core_generation=3 [2019-12-07 15:51:30,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:51:30,854 INFO L264 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2019-12-07 15:51:30,858 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:51:30,909 INFO L343 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2019-12-07 15:51:30,910 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 15:51:30,910 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:51:30,916 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:30,917 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:51:30,917 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:9, output treesize:11 [2019-12-07 15:51:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:30,929 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:51:30,936 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:30,936 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [497063465] [2019-12-07 15:51:30,937 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:51:30,937 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 2 [2019-12-07 15:51:30,938 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806226071] [2019-12-07 15:51:30,941 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-07 15:51:30,941 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:51:30,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-07 15:51:30,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-07 15:51:30,952 INFO L87 Difference]: Start difference. First operand 42 states. Second operand 3 states. [2019-12-07 15:51:31,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:51:31,025 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2019-12-07 15:51:31,026 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-07 15:51:31,027 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-07 15:51:31,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:51:31,034 INFO L225 Difference]: With dead ends: 47 [2019-12-07 15:51:31,034 INFO L226 Difference]: Without dead ends: 45 [2019-12-07 15:51:31,036 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-12-07 15:51:31,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-12-07 15:51:31,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2019-12-07 15:51:31,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-12-07 15:51:31,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2019-12-07 15:51:31,061 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 3 [2019-12-07 15:51:31,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:51:31,061 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2019-12-07 15:51:31,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-07 15:51:31,061 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2019-12-07 15:51:31,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-07 15:51:31,062 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:51:31,062 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-07 15:51:31,262 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 mathsat -unsat_core_generation=3 [2019-12-07 15:51:31,263 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:51:31,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:51:31,263 INFO L82 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2019-12-07 15:51:31,264 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:51:31,265 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351557071] [2019-12-07 15:51:31,265 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/mathsat Starting monitored process 3 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with mathsat -unsat_core_generation=3 [2019-12-07 15:51:31,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:51:31,311 INFO L264 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 8 conjunts are in the unsatisfiable core [2019-12-07 15:51:31,312 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:51:31,320 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_19|], 1=[|v_#valid_32|]} [2019-12-07 15:51:31,324 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:51:31,326 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 15:51:31,326 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:51:31,337 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:31,340 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:51:31,343 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 15:51:31,344 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:51:31,350 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:31,351 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:51:31,352 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-12-07 15:51:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:31,364 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:51:31,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:31,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351557071] [2019-12-07 15:51:31,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:51:31,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [] total 3 [2019-12-07 15:51:31,404 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159151443] [2019-12-07 15:51:31,405 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-07 15:51:31,405 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:51:31,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-07 15:51:31,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:51:31,406 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 4 states. [2019-12-07 15:51:31,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:51:31,503 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-12-07 15:51:31,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:51:31,504 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 3 [2019-12-07 15:51:31,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:51:31,505 INFO L225 Difference]: With dead ends: 37 [2019-12-07 15:51:31,505 INFO L226 Difference]: Without dead ends: 37 [2019-12-07 15:51:31,505 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-07 15:51:31,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-12-07 15:51:31,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-12-07 15:51:31,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-12-07 15:51:31,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-12-07 15:51:31,509 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 3 [2019-12-07 15:51:31,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:51:31,509 INFO L462 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-12-07 15:51:31,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-07 15:51:31,509 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-12-07 15:51:31,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-07 15:51:31,510 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:51:31,510 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-07 15:51:31,710 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 mathsat -unsat_core_generation=3 [2019-12-07 15:51:31,711 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:51:31,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:51:31,711 INFO L82 PathProgramCache]: Analyzing trace with hash 28691811, now seen corresponding path program 1 times [2019-12-07 15:51:31,712 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:51:31,713 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1603330171] [2019-12-07 15:51:31,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/mathsat Starting monitored process 4 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with mathsat -unsat_core_generation=3 [2019-12-07 15:51:31,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:51:31,768 INFO L264 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 15:51:31,768 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:51:31,773 INFO L430 ElimStorePlain]: Different costs {0=[|v_#length_21|], 1=[|v_#valid_34|]} [2019-12-07 15:51:31,777 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:51:31,778 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2019-12-07 15:51:31,778 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:51:31,786 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:31,789 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-12-07 15:51:31,791 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2019-12-07 15:51:31,791 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:51:31,798 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:31,798 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:51:31,798 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:21, output treesize:14 [2019-12-07 15:51:31,831 INFO L430 ElimStorePlain]: Different costs {1=[|v_#valid_35|], 3=[|v_#length_22|]} [2019-12-07 15:51:31,842 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:31,843 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 15:51:31,845 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:51:31,859 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:31,889 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:31,889 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 44 [2019-12-07 15:51:31,891 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:51:31,923 INFO L614 ElimStorePlain]: treesize reduction 24, result has 48.9 percent of original size [2019-12-07 15:51:31,924 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:51:31,927 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 2 dim-1 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:51:31,928 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:32, output treesize:23 [2019-12-07 15:51:31,928 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:51:31,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:31,945 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:51:31,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:51:32,055 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:51:32,078 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:32,079 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 15:51:32,079 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:51:32,096 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:32,096 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 17 [2019-12-07 15:51:32,097 INFO L534 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-12-07 15:51:32,126 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:32,127 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2019-12-07 15:51:32,128 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:44, output treesize:22 [2019-12-07 15:51:32,168 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:32,168 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1603330171] [2019-12-07 15:51:32,168 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:51:32,168 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 3] imperfect sequences [] total 6 [2019-12-07 15:51:32,168 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50653163] [2019-12-07 15:51:32,169 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-07 15:51:32,169 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:51:32,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-07 15:51:32,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:51:32,169 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 7 states. [2019-12-07 15:51:32,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:51:32,271 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-12-07 15:51:32,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-07 15:51:32,272 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 5 [2019-12-07 15:51:32,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:51:32,273 INFO L225 Difference]: With dead ends: 36 [2019-12-07 15:51:32,273 INFO L226 Difference]: Without dead ends: 36 [2019-12-07 15:51:32,273 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-07 15:51:32,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-12-07 15:51:32,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-12-07 15:51:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-12-07 15:51:32,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-12-07 15:51:32,276 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 5 [2019-12-07 15:51:32,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:51:32,277 INFO L462 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-12-07 15:51:32,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-07 15:51:32,277 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-12-07 15:51:32,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 15:51:32,277 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:51:32,277 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:51:32,478 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 mathsat -unsat_core_generation=3 [2019-12-07 15:51:32,479 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:51:32,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:51:32,479 INFO L82 PathProgramCache]: Analyzing trace with hash 1803025027, now seen corresponding path program 1 times [2019-12-07 15:51:32,480 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:51:32,480 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1022106483] [2019-12-07 15:51:32,481 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/mathsat Starting monitored process 5 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with mathsat -unsat_core_generation=3 [2019-12-07 15:51:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:51:32,535 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2019-12-07 15:51:32,536 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:51:32,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:32,555 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:51:32,571 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:32,572 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 18 [2019-12-07 15:51:32,573 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:51:32,573 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:51:32,575 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:32,576 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:51:32,576 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:14, output treesize:3 [2019-12-07 15:51:32,578 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:32,578 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1022106483] [2019-12-07 15:51:32,578 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:51:32,578 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 4 [2019-12-07 15:51:32,578 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398956372] [2019-12-07 15:51:32,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-07 15:51:32,579 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:51:32,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-07 15:51:32,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-07 15:51:32,580 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 5 states. [2019-12-07 15:51:32,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:51:32,729 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2019-12-07 15:51:32,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-07 15:51:32,730 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 7 [2019-12-07 15:51:32,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:51:32,731 INFO L225 Difference]: With dead ends: 38 [2019-12-07 15:51:32,731 INFO L226 Difference]: Without dead ends: 38 [2019-12-07 15:51:32,731 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:51:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-12-07 15:51:32,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 34. [2019-12-07 15:51:32,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2019-12-07 15:51:32,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2019-12-07 15:51:32,734 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 7 [2019-12-07 15:51:32,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:51:32,735 INFO L462 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2019-12-07 15:51:32,735 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-07 15:51:32,735 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2019-12-07 15:51:32,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-07 15:51:32,735 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:51:32,735 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:51:32,936 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 mathsat -unsat_core_generation=3 [2019-12-07 15:51:32,936 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:51:32,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:51:32,937 INFO L82 PathProgramCache]: Analyzing trace with hash 1803025028, now seen corresponding path program 1 times [2019-12-07 15:51:32,938 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:51:32,938 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947038781] [2019-12-07 15:51:32,938 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/mathsat Starting monitored process 6 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with mathsat -unsat_core_generation=3 [2019-12-07 15:51:32,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:51:33,002 INFO L264 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 11 conjunts are in the unsatisfiable core [2019-12-07 15:51:33,003 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:51:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:33,045 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:51:33,120 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:51:33,135 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2019-12-07 15:51:33,136 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:51:33,149 INFO L343 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:33,149 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 20 [2019-12-07 15:51:33,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:51:33,151 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:51:33,152 INFO L534 ElimStorePlain]: Start of recursive call 3: 2 dim-0 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2019-12-07 15:51:33,199 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:33,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:51:33,201 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: 3 dim-0 vars, and 2 xjuncts. [2019-12-07 15:51:33,201 INFO L239 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:31, output treesize:33 [2019-12-07 15:51:33,202 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:51:33,302 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:51:33,422 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-07 15:51:33,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:33,523 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [947038781] [2019-12-07 15:51:33,524 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:51:33,524 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4, 4] imperfect sequences [] total 7 [2019-12-07 15:51:33,524 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877706182] [2019-12-07 15:51:33,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-07 15:51:33,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:51:33,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-07 15:51:33,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-07 15:51:33,525 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 8 states. [2019-12-07 15:51:33,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:51:33,659 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2019-12-07 15:51:33,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-07 15:51:33,659 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 7 [2019-12-07 15:51:33,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:51:33,660 INFO L225 Difference]: With dead ends: 30 [2019-12-07 15:51:33,660 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 15:51:33,661 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:51:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 15:51:33,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2019-12-07 15:51:33,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-12-07 15:51:33,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 30 transitions. [2019-12-07 15:51:33,664 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 30 transitions. Word has length 7 [2019-12-07 15:51:33,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:51:33,664 INFO L462 AbstractCegarLoop]: Abstraction has 30 states and 30 transitions. [2019-12-07 15:51:33,664 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-07 15:51:33,664 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 30 transitions. [2019-12-07 15:51:33,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-12-07 15:51:33,664 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:51:33,665 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:51:33,865 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 mathsat -unsat_core_generation=3 [2019-12-07 15:51:33,866 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:51:33,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:51:33,866 INFO L82 PathProgramCache]: Analyzing trace with hash -1591396527, now seen corresponding path program 1 times [2019-12-07 15:51:33,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:51:33,867 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1434366297] [2019-12-07 15:51:33,867 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/mathsat Starting monitored process 7 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with mathsat -unsat_core_generation=3 [2019-12-07 15:51:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:51:33,918 INFO L264 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 15:51:33,919 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:51:33,935 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 15:51:33,935 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:51:33,937 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:33,938 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:51:33,938 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2019-12-07 15:51:33,958 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 15:51:33,959 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:51:33,960 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:33,960 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:51:33,961 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:19, output treesize:3 [2019-12-07 15:51:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:33,987 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:51:33,993 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-12-07 15:51:33,993 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 3 xjuncts. [2019-12-07 15:51:33,999 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:33,999 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2019-12-07 15:51:34,000 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:14 [2019-12-07 15:51:34,005 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:34,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1434366297] [2019-12-07 15:51:34,005 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:51:34,005 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 8 [2019-12-07 15:51:34,005 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221950955] [2019-12-07 15:51:34,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-07 15:51:34,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:51:34,006 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-07 15:51:34,006 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-07 15:51:34,006 INFO L87 Difference]: Start difference. First operand 30 states and 30 transitions. Second operand 9 states. [2019-12-07 15:51:34,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:51:34,327 INFO L93 Difference]: Finished difference Result 32 states and 31 transitions. [2019-12-07 15:51:34,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 15:51:34,327 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 12 [2019-12-07 15:51:34,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:51:34,327 INFO L225 Difference]: With dead ends: 32 [2019-12-07 15:51:34,327 INFO L226 Difference]: Without dead ends: 32 [2019-12-07 15:51:34,328 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=170, Unknown=0, NotChecked=0, Total=240 [2019-12-07 15:51:34,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-12-07 15:51:34,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 28. [2019-12-07 15:51:34,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-12-07 15:51:34,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-12-07 15:51:34,330 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 12 [2019-12-07 15:51:34,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:51:34,330 INFO L462 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-12-07 15:51:34,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-07 15:51:34,330 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-12-07 15:51:34,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-07 15:51:34,331 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:51:34,331 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:51:34,531 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 mathsat -unsat_core_generation=3 [2019-12-07 15:51:34,532 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:51:34,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:51:34,533 INFO L82 PathProgramCache]: Analyzing trace with hash -2088652025, now seen corresponding path program 1 times [2019-12-07 15:51:34,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:51:34,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1376787400] [2019-12-07 15:51:34,534 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/mathsat Starting monitored process 8 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with mathsat -unsat_core_generation=3 [2019-12-07 15:51:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:51:34,616 INFO L264 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjunts are in the unsatisfiable core [2019-12-07 15:51:34,617 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:51:34,692 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 15:51:34,692 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:51:34,709 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:34,710 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:51:34,710 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:24, output treesize:17 [2019-12-07 15:51:34,763 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2019-12-07 15:51:34,764 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:51:34,771 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:34,772 INFO L534 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:51:34,772 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 4 variables, input treesize:26, output treesize:11 [2019-12-07 15:51:34,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:34,851 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:51:35,016 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2019-12-07 15:51:35,016 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:51:35,061 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:35,062 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:51:35,062 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:19, output treesize:32 [2019-12-07 15:51:35,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-12-07 15:51:35,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:35,241 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1376787400] [2019-12-07 15:51:35,241 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:51:35,241 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 16 [2019-12-07 15:51:35,241 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149528983] [2019-12-07 15:51:35,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-12-07 15:51:35,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:51:35,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-12-07 15:51:35,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2019-12-07 15:51:35,242 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 17 states. [2019-12-07 15:51:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:51:36,136 INFO L93 Difference]: Finished difference Result 30 states and 29 transitions. [2019-12-07 15:51:36,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-07 15:51:36,137 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 13 [2019-12-07 15:51:36,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:51:36,137 INFO L225 Difference]: With dead ends: 30 [2019-12-07 15:51:36,137 INFO L226 Difference]: Without dead ends: 30 [2019-12-07 15:51:36,137 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=143, Invalid=409, Unknown=0, NotChecked=0, Total=552 [2019-12-07 15:51:36,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2019-12-07 15:51:36,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2019-12-07 15:51:36,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2019-12-07 15:51:36,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2019-12-07 15:51:36,140 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 13 [2019-12-07 15:51:36,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:51:36,140 INFO L462 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2019-12-07 15:51:36,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-12-07 15:51:36,140 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2019-12-07 15:51:36,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-07 15:51:36,140 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:51:36,141 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:51:36,341 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 mathsat -unsat_core_generation=3 [2019-12-07 15:51:36,341 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:51:36,342 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:51:36,342 INFO L82 PathProgramCache]: Analyzing trace with hash -323703277, now seen corresponding path program 1 times [2019-12-07 15:51:36,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:51:36,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263712751] [2019-12-07 15:51:36,343 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/mathsat Starting monitored process 9 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with mathsat -unsat_core_generation=3 [2019-12-07 15:51:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-07 15:51:36,413 INFO L264 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 14 conjunts are in the unsatisfiable core [2019-12-07 15:51:36,415 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2019-12-07 15:51:36,426 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2019-12-07 15:51:36,426 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:51:36,434 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:36,434 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:51:36,434 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:13, output treesize:12 [2019-12-07 15:51:36,447 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2019-12-07 15:51:36,447 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:51:36,453 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:36,454 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:51:36,454 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:13 [2019-12-07 15:51:36,477 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2019-12-07 15:51:36,478 INFO L534 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-12-07 15:51:36,479 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:36,479 INFO L534 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-12-07 15:51:36,480 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:21, output treesize:5 [2019-12-07 15:51:36,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:36,514 INFO L329 TraceCheckSpWp]: Computing backward predicates... [2019-12-07 15:51:36,520 INFO L377 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2019-12-07 15:51:36,520 INFO L534 ElimStorePlain]: Start of recursive call 2: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:51:36,537 INFO L614 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-12-07 15:51:36,538 INFO L534 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2019-12-07 15:51:36,538 INFO L239 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:36 [2019-12-07 15:51:36,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-07 15:51:36,583 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263712751] [2019-12-07 15:51:36,583 INFO L220 FreeRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-12-07 15:51:36,583 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8, 8] imperfect sequences [] total 9 [2019-12-07 15:51:36,583 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536045655] [2019-12-07 15:51:36,584 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-07 15:51:36,584 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WALRUS [2019-12-07 15:51:36,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-07 15:51:36,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-07 15:51:36,584 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 10 states. [2019-12-07 15:51:36,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-07 15:51:36,956 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2019-12-07 15:51:36,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-07 15:51:36,957 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 14 [2019-12-07 15:51:36,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-07 15:51:36,958 INFO L225 Difference]: With dead ends: 27 [2019-12-07 15:51:36,958 INFO L226 Difference]: Without dead ends: 27 [2019-12-07 15:51:36,958 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2019-12-07 15:51:36,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2019-12-07 15:51:36,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2019-12-07 15:51:36,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2019-12-07 15:51:36,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2019-12-07 15:51:36,960 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 14 [2019-12-07 15:51:36,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-07 15:51:36,960 INFO L462 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2019-12-07 15:51:36,960 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-07 15:51:36,960 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2019-12-07 15:51:36,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-07 15:51:36,960 INFO L402 BasicCegarLoop]: Found error trace [2019-12-07 15:51:36,960 INFO L410 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-07 15:51:37,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 mathsat -unsat_core_generation=3 [2019-12-07 15:51:37,162 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr15REQUIRES_VIOLATION, ULTIMATE.startErr4REQUIRES_VIOLATION, ULTIMATE.startErr14REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr7REQUIRES_VIOLATION, ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr17REQUIRES_VIOLATION, ULTIMATE.startErr6REQUIRES_VIOLATION, ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr16REQUIRES_VIOLATION, ULTIMATE.startErr5REQUIRES_VIOLATION, ULTIMATE.startErr18ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE]=== [2019-12-07 15:51:37,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-07 15:51:37,162 INFO L82 PathProgramCache]: Analyzing trace with hash -1431505607, now seen corresponding path program 1 times [2019-12-07 15:51:37,162 INFO L163 FreeRefinementEngine]: Executing refinement strategy WALRUS [2019-12-07 15:51:37,163 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1783212286] [2019-12-07 15:51:37,163 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_3a21f08b-0c1b-491d-8e71-dcb5d815d895/bin/utaipan/mathsat Starting monitored process 10 with mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with mathsat -unsat_core_generation=3 [2019-12-07 15:51:37,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:51:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-07 15:51:37,289 INFO L174 FreeRefinementEngine]: Strategy WALRUS found a feasible trace [2019-12-07 15:51:37,289 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-12-07 15:51:37,490 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 mathsat -unsat_core_generation=3 [2019-12-07 15:51:37,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.12 03:51:37 BoogieIcfgContainer [2019-12-07 15:51:37,530 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-07 15:51:37,530 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-07 15:51:37,530 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-07 15:51:37,530 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-07 15:51:37,531 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.12 03:51:30" (3/4) ... [2019-12-07 15:51:37,534 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-07 15:51:37,534 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-07 15:51:37,535 INFO L168 Benchmark]: Toolchain (without parser) took 7400.20 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 192.4 MB). Free memory was 947.0 MB in the beginning and 1.0 GB in the end (delta: -58.9 MB). Peak memory consumption was 133.6 MB. Max. memory is 11.5 GB. [2019-12-07 15:51:37,535 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:51:37,536 INFO L168 Benchmark]: CACSL2BoogieTranslator took 297.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -153.1 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. [2019-12-07 15:51:37,536 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:51:37,536 INFO L168 Benchmark]: Boogie Preprocessor took 18.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. [2019-12-07 15:51:37,537 INFO L168 Benchmark]: RCFGBuilder took 260.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. [2019-12-07 15:51:37,537 INFO L168 Benchmark]: TraceAbstraction took 6786.65 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 62.9 MB). Peak memory consumption was 135.8 MB. Max. memory is 11.5 GB. [2019-12-07 15:51:37,537 INFO L168 Benchmark]: Witness Printer took 3.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-07 15:51:37,539 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 297.77 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -153.1 MB). Peak memory consumption was 21.3 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.86 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.65 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.7 MB). Peak memory consumption was 6.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 260.31 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 24.6 MB). Peak memory consumption was 24.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 6786.65 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 72.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 62.9 MB). Peak memory consumption was 135.8 MB. Max. memory is 11.5 GB. * Witness Printer took 3.90 ms. Allocated memory is still 1.2 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 532]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 532. Possible FailurePath: [L533] TData data; [L518] pdata->lo = malloc(16) [L519] pdata->hi = malloc(24) [L523] EXPR data->lo [L523] void *lo = data->lo; [L524] EXPR data->hi [L524] void *hi = data->hi; [L525] COND FALSE !(lo == hi) [L529] data->lo = (void *) 0 [L530] data->hi = (void *) 0 [L536] return 0; [L536] return 0; - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 42 locations, 19 error locations. Result: UNSAFE, OverallTime: 6.7s, OverallIterations: 9, TraceHistogramMax: 1, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 142 SDtfs, 567 SDslu, 142 SDs, 0 SdLazy, 404 SolverSat, 84 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 138 GetRequests, 58 SyntacticMatches, 7 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 8 MinimizatonAttempts, 21 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 79 NumberOfCodeBlocks, 79 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 112 ConstructedInterpolants, 22 QuantifiedInterpolants, 9583 SizeOfPredicates, 81 NumberOfNonLiveVariables, 364 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...