./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-properties/list_flag-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/list_flag-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:55:48,983 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:55:48,986 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:55:49,037 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:55:49,038 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:55:49,041 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:55:49,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:55:49,047 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:55:49,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:55:49,053 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:55:49,054 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:55:49,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:55:49,056 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:55:49,058 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:55:49,059 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:55:49,064 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:55:49,065 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:55:49,066 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:55:49,069 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:55:49,076 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:55:49,078 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:55:49,079 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:55:49,081 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:55:49,081 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:55:49,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:55:49,088 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:55:49,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:55:49,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:55:49,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:55:49,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:55:49,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:55:49,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:55:49,094 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:55:49,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:55:49,096 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:55:49,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:55:49,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:55:49,097 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:55:49,098 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:55:49,098 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:55:49,099 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:55:49,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:55:49,139 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:55:49,140 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:55:49,140 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:55:49,140 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:55:49,141 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:55:49,142 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:55:49,142 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:55:49,142 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:55:49,142 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:55:49,143 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:55:49,144 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:55:49,144 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:55:49,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:55:49,144 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:55:49,144 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:55:49,145 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:55:49,145 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:55:49,145 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:55:49,145 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:55:49,145 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:55:49,145 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:55:49,146 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:55:49,146 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:55:49,146 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:55:49,146 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:55:49,146 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:55:49,147 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:55:49,148 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:55:49,148 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:55:49,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:55:49,149 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da [2022-02-20 23:55:49,352 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:55:49,379 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:55:49,382 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:55:49,383 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:55:49,384 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:55:49,385 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_flag-2.i [2022-02-20 23:55:49,461 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e381b94c/865966e4bd8e471ba0e3a97db356cadc/FLAGf112d8b8d [2022-02-20 23:55:49,837 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:55:49,837 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i [2022-02-20 23:55:49,852 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e381b94c/865966e4bd8e471ba0e3a97db356cadc/FLAGf112d8b8d [2022-02-20 23:55:50,203 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9e381b94c/865966e4bd8e471ba0e3a97db356cadc [2022-02-20 23:55:50,205 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:55:50,206 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:55:50,212 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:55:50,212 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:55:50,215 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:55:50,216 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:55:50" (1/1) ... [2022-02-20 23:55:50,218 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@506d09f4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:50, skipping insertion in model container [2022-02-20 23:55:50,219 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:55:50" (1/1) ... [2022-02-20 23:55:50,225 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:55:50,260 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:55:50,564 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i[23375,23388] [2022-02-20 23:55:50,566 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:55:50,577 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:55:50,614 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i[23375,23388] [2022-02-20 23:55:50,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:55:50,641 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:55:50,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:50 WrapperNode [2022-02-20 23:55:50,642 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:55:50,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:55:50,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:55:50,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:55:50,658 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:50" (1/1) ... [2022-02-20 23:55:50,676 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:50" (1/1) ... [2022-02-20 23:55:50,697 INFO L137 Inliner]: procedures = 124, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 70 [2022-02-20 23:55:50,697 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:55:50,698 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:55:50,698 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:55:50,698 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:55:50,705 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:50" (1/1) ... [2022-02-20 23:55:50,705 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:50" (1/1) ... [2022-02-20 23:55:50,708 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:50" (1/1) ... [2022-02-20 23:55:50,709 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:50" (1/1) ... [2022-02-20 23:55:50,717 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:50" (1/1) ... [2022-02-20 23:55:50,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:50" (1/1) ... [2022-02-20 23:55:50,723 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:50" (1/1) ... [2022-02-20 23:55:50,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:55:50,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:55:50,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:55:50,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:55:50,728 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:50" (1/1) ... [2022-02-20 23:55:50,736 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:55:50,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:55:50,760 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:55:50,762 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:55:50,792 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-02-20 23:55:50,792 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-02-20 23:55:50,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:55:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:55:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:55:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:55:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:55:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:55:50,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:55:50,794 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:55:50,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:55:50,869 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:55:50,870 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:55:50,930 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-02-20 23:55:51,239 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:55:51,246 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:55:51,246 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 23:55:51,248 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:55:51 BoogieIcfgContainer [2022-02-20 23:55:51,249 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:55:51,250 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:55:51,251 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:55:51,254 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:55:51,255 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:55:50" (1/3) ... [2022-02-20 23:55:51,256 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26973e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:55:51, skipping insertion in model container [2022-02-20 23:55:51,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:50" (2/3) ... [2022-02-20 23:55:51,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26973e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:55:51, skipping insertion in model container [2022-02-20 23:55:51,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:55:51" (3/3) ... [2022-02-20 23:55:51,258 INFO L111 eAbstractionObserver]: Analyzing ICFG list_flag-2.i [2022-02-20 23:55:51,263 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:55:51,264 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2022-02-20 23:55:51,311 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:55:51,319 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:55:51,319 INFO L340 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-02-20 23:55:51,343 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 32 states have (on average 2.03125) internal successors, (65), 55 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:51,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:55:51,348 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:51,348 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:55:51,349 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:55:51,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:51,354 INFO L85 PathProgramCache]: Analyzing trace with hash 1037517512, now seen corresponding path program 1 times [2022-02-20 23:55:51,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:51,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714684275] [2022-02-20 23:55:51,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:51,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:51,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:51,512 INFO L290 TraceCheckUtils]: 0: Hoare triple {60#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {60#true} is VALID [2022-02-20 23:55:51,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {60#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet5#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem8#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_~flag~0#1, main_~p~0#1.base, main_~p~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~flag~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;havoc main_~p~0#1.base, main_~p~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~t~0#1.base, main_~t~0#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {60#true} is VALID [2022-02-20 23:55:51,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {60#true} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {60#true} is VALID [2022-02-20 23:55:51,514 INFO L290 TraceCheckUtils]: 3: Hoare triple {60#true} main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {60#true} is VALID [2022-02-20 23:55:51,514 INFO L290 TraceCheckUtils]: 4: Hoare triple {60#true} assume !true; {61#false} is VALID [2022-02-20 23:55:51,515 INFO L290 TraceCheckUtils]: 5: Hoare triple {61#false} assume !(1 == #valid[main_~p~0#1.base]); {61#false} is VALID [2022-02-20 23:55:51,516 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:51,517 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:51,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714684275] [2022-02-20 23:55:51,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714684275] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:51,518 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:51,518 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:55:51,520 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648150488] [2022-02-20 23:55:51,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:51,525 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:55:51,527 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:51,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:51,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:51,543 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:55:51,543 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:51,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:55:51,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:55:51,571 INFO L87 Difference]: Start difference. First operand has 57 states, 32 states have (on average 2.03125) internal successors, (65), 55 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:51,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:51,655 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-02-20 23:55:51,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:55:51,656 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:55:51,656 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:51,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2022-02-20 23:55:51,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:51,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 67 transitions. [2022-02-20 23:55:51,675 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 67 transitions. [2022-02-20 23:55:51,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:51,757 INFO L225 Difference]: With dead ends: 57 [2022-02-20 23:55:51,758 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 23:55:51,759 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:55:51,762 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:51,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:55:51,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 23:55:51,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-20 23:55:51,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:51,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 29 states have (on average 1.896551724137931) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:51,788 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 29 states have (on average 1.896551724137931) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:51,789 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 29 states have (on average 1.896551724137931) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:51,794 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-02-20 23:55:51,794 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-02-20 23:55:51,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:51,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:51,795 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 29 states have (on average 1.896551724137931) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 23:55:51,796 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.896551724137931) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 51 states. [2022-02-20 23:55:51,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:51,802 INFO L93 Difference]: Finished difference Result 51 states and 55 transitions. [2022-02-20 23:55:51,802 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-02-20 23:55:51,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:51,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:51,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:51,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:51,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.896551724137931) internal successors, (55), 50 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:51,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 55 transitions. [2022-02-20 23:55:51,809 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 55 transitions. Word has length 6 [2022-02-20 23:55:51,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:51,810 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 55 transitions. [2022-02-20 23:55:51,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:51,810 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 55 transitions. [2022-02-20 23:55:51,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:55:51,811 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:51,811 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:51,811 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:55:51,812 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:55:51,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:51,814 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238129, now seen corresponding path program 1 times [2022-02-20 23:55:51,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:51,815 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511923860] [2022-02-20 23:55:51,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:51,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:51,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:51,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {274#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {274#true} is VALID [2022-02-20 23:55:51,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {274#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet5#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem8#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_~flag~0#1, main_~p~0#1.base, main_~p~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~flag~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;havoc main_~p~0#1.base, main_~p~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~t~0#1.base, main_~t~0#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {276#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:55:51,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {276#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {276#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} is VALID [2022-02-20 23:55:51,915 INFO L290 TraceCheckUtils]: 3: Hoare triple {276#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) 1)} main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {277#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:55:51,915 INFO L290 TraceCheckUtils]: 4: Hoare triple {277#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {277#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:55:51,916 INFO L290 TraceCheckUtils]: 5: Hoare triple {277#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {277#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:55:51,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {277#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume !(1 == #valid[main_~p~0#1.base]); {275#false} is VALID [2022-02-20 23:55:51,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:51,918 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:51,918 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511923860] [2022-02-20 23:55:51,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511923860] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:51,919 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:51,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:55:51,919 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158683633] [2022-02-20 23:55:51,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:51,921 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:55:51,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:51,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:51,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:51,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:55:51,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:51,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:55:51,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:55:51,937 INFO L87 Difference]: Start difference. First operand 51 states and 55 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:52,094 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-02-20 23:55:52,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:55:52,094 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:55:52,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:52,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-02-20 23:55:52,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 75 transitions. [2022-02-20 23:55:52,098 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 75 transitions. [2022-02-20 23:55:52,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:52,170 INFO L225 Difference]: With dead ends: 59 [2022-02-20 23:55:52,170 INFO L226 Difference]: Without dead ends: 59 [2022-02-20 23:55:52,170 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:55:52,171 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 94 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:52,172 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 25 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:52,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-20 23:55:52,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 54. [2022-02-20 23:55:52,176 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:52,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 54 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 53 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,177 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 54 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 53 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,177 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 54 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 53 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:52,181 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-02-20 23:55:52,182 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-02-20 23:55:52,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:52,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:52,184 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 53 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 59 states. [2022-02-20 23:55:52,184 INFO L87 Difference]: Start difference. First operand has 54 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 53 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 59 states. [2022-02-20 23:55:52,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:52,189 INFO L93 Difference]: Finished difference Result 59 states and 65 transitions. [2022-02-20 23:55:52,195 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 65 transitions. [2022-02-20 23:55:52,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:52,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:52,197 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:52,197 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 37 states have (on average 1.7567567567567568) internal successors, (65), 53 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2022-02-20 23:55:52,201 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 7 [2022-02-20 23:55:52,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:52,202 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2022-02-20 23:55:52,202 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,203 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2022-02-20 23:55:52,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:55:52,206 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:52,206 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:52,207 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:55:52,208 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:55:52,208 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:52,208 INFO L85 PathProgramCache]: Analyzing trace with hash 2098238130, now seen corresponding path program 1 times [2022-02-20 23:55:52,209 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:52,209 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372263119] [2022-02-20 23:55:52,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:52,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:52,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:52,298 INFO L290 TraceCheckUtils]: 0: Hoare triple {513#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {513#true} is VALID [2022-02-20 23:55:52,299 INFO L290 TraceCheckUtils]: 1: Hoare triple {513#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet5#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem8#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_~flag~0#1, main_~p~0#1.base, main_~p~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_~flag~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;havoc main_~p~0#1.base, main_~p~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~t~0#1.base, main_~t~0#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {515#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) 8))} is VALID [2022-02-20 23:55:52,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {515#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) 8))} assume !(main_~a~0#1.base == 0 && main_~a~0#1.offset == 0); {515#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) 8))} is VALID [2022-02-20 23:55:52,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {515#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~a~0#1.base|) 8))} main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {516#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:55:52,306 INFO L290 TraceCheckUtils]: 4: Hoare triple {516#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {516#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:55:52,307 INFO L290 TraceCheckUtils]: 5: Hoare triple {516#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {516#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:55:52,307 INFO L290 TraceCheckUtils]: 6: Hoare triple {516#(and (= (+ (select |#length| |ULTIMATE.start_main_~p~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(4 + main_~p~0#1.offset <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset); {514#false} is VALID [2022-02-20 23:55:52,308 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:52,308 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:52,308 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372263119] [2022-02-20 23:55:52,308 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372263119] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:52,309 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:52,309 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:55:52,309 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1065675048] [2022-02-20 23:55:52,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:52,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:55:52,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:52,311 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,320 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:52,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:55:52,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:55:52,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:55:52,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:55:52,321 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:52,555 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-02-20 23:55:52,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:55:52,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:55:52,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:52,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-02-20 23:55:52,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 89 transitions. [2022-02-20 23:55:52,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 89 transitions. [2022-02-20 23:55:52,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:52,655 INFO L225 Difference]: With dead ends: 72 [2022-02-20 23:55:52,660 INFO L226 Difference]: Without dead ends: 72 [2022-02-20 23:55:52,660 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:55:52,665 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 97 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:52,668 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 40 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:52,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-20 23:55:52,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2022-02-20 23:55:52,674 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:52,675 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 63 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 62 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,676 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 63 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 62 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,679 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 63 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 62 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:52,682 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-02-20 23:55:52,682 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-02-20 23:55:52,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:52,684 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:52,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 62 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 72 states. [2022-02-20 23:55:52,685 INFO L87 Difference]: Start difference. First operand has 63 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 62 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 72 states. [2022-02-20 23:55:52,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:52,689 INFO L93 Difference]: Finished difference Result 72 states and 79 transitions. [2022-02-20 23:55:52,692 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 79 transitions. [2022-02-20 23:55:52,693 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:52,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:52,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:52,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:52,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 46 states have (on average 1.5434782608695652) internal successors, (71), 62 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2022-02-20 23:55:52,697 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 7 [2022-02-20 23:55:52,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:52,698 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2022-02-20 23:55:52,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:52,698 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2022-02-20 23:55:52,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:55:52,699 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:52,699 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:52,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:55:52,699 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:55:52,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:52,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1259067004, now seen corresponding path program 1 times [2022-02-20 23:55:52,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:52,701 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957886202] [2022-02-20 23:55:52,701 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:52,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:55:52,726 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:55:52,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:55:52,774 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:55:52,775 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:55:52,776 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (21 of 22 remaining) [2022-02-20 23:55:52,777 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (20 of 22 remaining) [2022-02-20 23:55:52,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (19 of 22 remaining) [2022-02-20 23:55:52,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (18 of 22 remaining) [2022-02-20 23:55:52,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (17 of 22 remaining) [2022-02-20 23:55:52,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (16 of 22 remaining) [2022-02-20 23:55:52,778 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (15 of 22 remaining) [2022-02-20 23:55:52,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (14 of 22 remaining) [2022-02-20 23:55:52,779 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (13 of 22 remaining) [2022-02-20 23:55:52,781 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (12 of 22 remaining) [2022-02-20 23:55:52,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (11 of 22 remaining) [2022-02-20 23:55:52,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (10 of 22 remaining) [2022-02-20 23:55:52,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (9 of 22 remaining) [2022-02-20 23:55:52,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (8 of 22 remaining) [2022-02-20 23:55:52,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (7 of 22 remaining) [2022-02-20 23:55:52,782 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (6 of 22 remaining) [2022-02-20 23:55:52,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (5 of 22 remaining) [2022-02-20 23:55:52,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (4 of 22 remaining) [2022-02-20 23:55:52,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (3 of 22 remaining) [2022-02-20 23:55:52,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (2 of 22 remaining) [2022-02-20 23:55:52,783 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (1 of 22 remaining) [2022-02-20 23:55:52,784 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 22 remaining) [2022-02-20 23:55:52,785 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:55:52,789 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 23:55:52,792 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:55:52,819 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:55:52 BoogieIcfgContainer [2022-02-20 23:55:52,820 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:55:52,821 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:55:52,821 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:55:52,821 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:55:52,822 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:55:51" (3/4) ... [2022-02-20 23:55:52,824 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 23:55:52,825 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:55:52,826 INFO L158 Benchmark]: Toolchain (without parser) took 2619.04ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.2MB in the beginning and 69.5MB in the end (delta: -18.3MB). Peak memory consumption was 1.0MB. Max. memory is 16.1GB. [2022-02-20 23:55:52,826 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory was 55.9MB in the beginning and 55.9MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:55:52,826 INFO L158 Benchmark]: CACSL2BoogieTranslator took 429.77ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.0MB in the beginning and 72.2MB in the end (delta: -21.2MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2022-02-20 23:55:52,827 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.80ms. Allocated memory is still 104.9MB. Free memory was 72.2MB in the beginning and 70.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:55:52,827 INFO L158 Benchmark]: Boogie Preprocessor took 28.03ms. Allocated memory is still 104.9MB. Free memory was 70.3MB in the beginning and 68.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:55:52,827 INFO L158 Benchmark]: RCFGBuilder took 522.05ms. Allocated memory is still 104.9MB. Free memory was 68.3MB in the beginning and 75.4MB in the end (delta: -7.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. [2022-02-20 23:55:52,828 INFO L158 Benchmark]: TraceAbstraction took 1569.34ms. Allocated memory is still 104.9MB. Free memory was 75.0MB in the beginning and 69.5MB in the end (delta: 5.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-02-20 23:55:52,828 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 104.9MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:55:52,829 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 86.0MB. Free memory was 55.9MB in the beginning and 55.9MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 429.77ms. Allocated memory was 86.0MB in the beginning and 104.9MB in the end (delta: 18.9MB). Free memory was 51.0MB in the beginning and 72.2MB in the end (delta: -21.2MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.80ms. Allocated memory is still 104.9MB. Free memory was 72.2MB in the beginning and 70.3MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.03ms. Allocated memory is still 104.9MB. Free memory was 70.3MB in the beginning and 68.7MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 522.05ms. Allocated memory is still 104.9MB. Free memory was 68.3MB in the beginning and 75.4MB in the end (delta: -7.1MB). Peak memory consumption was 16.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1569.34ms. Allocated memory is still 104.9MB. Free memory was 75.0MB in the beginning and 69.5MB in the end (delta: 5.4MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 104.9MB. Free memory is still 69.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] int flag = __VERIFIER_nondet_int(); [L533] List p, a, t; [L534] a = (List) malloc(sizeof(struct node)) [L535] COND FALSE !(a == 0) VAL [a={-1:0}, flag=0] [L536] p = a VAL [a={-1:0}, flag=0, p={-1:0}] [L537] COND FALSE !(__VERIFIER_nondet_int()) [L548] p->h = 3 VAL [a={-1:0}, flag=0, p={-1:0}] [L549] p = a VAL [a={-1:0}, flag=0, p={-1:0}] [L550] COND FALSE !(\read(flag)) VAL [a={-1:0}, flag=0, p={-1:0}] [L554] EXPR p->h VAL [a={-1:0}, flag=0, p={-1:0}, p->h=3] [L554] COND FALSE !(p->h == 2) [L556] EXPR p->h VAL [a={-1:0}, flag=0, p={-1:0}, p->h=3] [L556] COND FALSE !(p->h != 3) - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 546]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 546]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 58 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 1.5s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 191 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 191 mSDsluCounter, 128 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 109 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=63occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 34 NumberOfCodeBlocks, 34 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 17 ConstructedInterpolants, 0 QuantifiedInterpolants, 83 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: 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 [2022-02-20 23:55:52,860 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-properties/list_flag-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:55:54,865 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:55:54,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:55:54,912 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:55:54,913 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:55:54,917 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:55:54,918 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:55:54,924 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:55:54,927 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:55:54,932 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:55:54,933 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:55:54,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:55:54,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:55:54,940 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:55:54,940 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:55:54,941 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:55:54,942 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:55:54,942 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:55:54,943 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:55:54,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:55:54,945 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:55:54,948 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:55:54,949 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:55:54,950 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:55:54,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:55:54,957 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:55:54,958 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:55:54,959 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:55:54,960 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:55:54,961 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:55:54,961 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:55:54,962 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:55:54,963 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:55:54,964 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:55:54,964 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:55:54,965 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:55:54,966 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:55:54,966 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:55:54,966 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:55:54,968 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:55:54,968 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:55:54,972 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:55:54,999 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:55:55,000 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:55:55,001 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:55:55,001 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:55:55,002 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:55:55,002 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:55:55,003 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:55:55,003 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:55:55,003 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:55:55,004 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:55:55,005 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:55:55,005 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:55:55,005 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:55:55,005 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:55:55,005 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:55:55,006 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:55:55,006 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:55:55,006 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:55:55,006 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:55:55,006 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:55:55,006 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:55:55,007 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:55:55,007 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:55:55,007 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:55:55,007 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:55:55,007 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:55:55,016 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:55:55,016 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:55:55,016 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:55:55,016 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:55:55,017 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:55:55,017 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:55:55,017 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:55:55,017 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4547628201bbb61f481f84914c46868091db8c6a3d0c4d8890951b495ae3c7da [2022-02-20 23:55:55,311 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:55:55,336 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:55:55,339 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:55:55,340 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:55:55,341 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:55:55,342 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-properties/list_flag-2.i [2022-02-20 23:55:55,407 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b14bba9/37491bd1d87144619661302a55eb8ab0/FLAG50154018e [2022-02-20 23:55:55,923 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:55:55,924 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i [2022-02-20 23:55:55,948 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b14bba9/37491bd1d87144619661302a55eb8ab0/FLAG50154018e [2022-02-20 23:55:56,267 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7b14bba9/37491bd1d87144619661302a55eb8ab0 [2022-02-20 23:55:56,269 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:55:56,271 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:55:56,272 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:55:56,272 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:55:56,275 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:55:56,276 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:55:56" (1/1) ... [2022-02-20 23:55:56,277 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48caec23 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:56, skipping insertion in model container [2022-02-20 23:55:56,278 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:55:56" (1/1) ... [2022-02-20 23:55:56,284 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:55:56,318 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:55:56,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i[23375,23388] [2022-02-20 23:55:56,574 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:55:56,595 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:55:56,648 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-properties/list_flag-2.i[23375,23388] [2022-02-20 23:55:56,649 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:55:56,678 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:55:56,679 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:56 WrapperNode [2022-02-20 23:55:56,679 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:55:56,680 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:55:56,680 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:55:56,681 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:55:56,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:56" (1/1) ... [2022-02-20 23:55:56,710 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:56" (1/1) ... [2022-02-20 23:55:56,740 INFO L137 Inliner]: procedures = 127, calls = 20, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 69 [2022-02-20 23:55:56,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:55:56,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:55:56,744 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:55:56,744 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:55:56,750 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:56" (1/1) ... [2022-02-20 23:55:56,750 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:56" (1/1) ... [2022-02-20 23:55:56,759 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:56" (1/1) ... [2022-02-20 23:55:56,759 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:56" (1/1) ... [2022-02-20 23:55:56,769 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:56" (1/1) ... [2022-02-20 23:55:56,772 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:56" (1/1) ... [2022-02-20 23:55:56,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:56" (1/1) ... [2022-02-20 23:55:56,777 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:55:56,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:55:56,778 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:55:56,778 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:55:56,779 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:56" (1/1) ... [2022-02-20 23:55:56,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:55:56,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:55:56,820 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:55:56,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:55:56,854 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2022-02-20 23:55:56,855 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2022-02-20 23:55:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:55:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:55:56,855 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:55:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:55:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:55:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:55:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:55:56,856 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:55:56,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:55:56,996 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:55:56,997 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:55:57,041 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2022-02-20 23:55:57,364 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:55:57,370 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:55:57,374 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 23:55:57,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:55:57 BoogieIcfgContainer [2022-02-20 23:55:57,376 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:55:57,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:55:57,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:55:57,382 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:55:57,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:55:56" (1/3) ... [2022-02-20 23:55:57,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68843e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:55:57, skipping insertion in model container [2022-02-20 23:55:57,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:56" (2/3) ... [2022-02-20 23:55:57,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68843e72 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:55:57, skipping insertion in model container [2022-02-20 23:55:57,384 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:55:57" (3/3) ... [2022-02-20 23:55:57,386 INFO L111 eAbstractionObserver]: Analyzing ICFG list_flag-2.i [2022-02-20 23:55:57,392 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:55:57,392 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 22 error locations. [2022-02-20 23:55:57,440 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:55:57,449 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:55:57,450 INFO L340 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2022-02-20 23:55:57,469 INFO L276 IsEmpty]: Start isEmpty. Operand has 56 states, 31 states have (on average 2.064516129032258) internal successors, (64), 54 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:57,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:55:57,474 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:57,476 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:55:57,476 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:55:57,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:57,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1037517480, now seen corresponding path program 1 times [2022-02-20 23:55:57,508 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:57,508 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [816118271] [2022-02-20 23:55:57,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:57,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:57,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:57,512 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:57,514 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:55:57,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:57,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 23:55:57,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:57,600 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:57,646 INFO L290 TraceCheckUtils]: 0: Hoare triple {59#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {59#true} is VALID [2022-02-20 23:55:57,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {59#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet5#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem8#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_~flag~0#1, main_~p~0#1.base, main_~p~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset;main_~flag~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;havoc main_~p~0#1.base, main_~p~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~t~0#1.base, main_~t~0#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {59#true} is VALID [2022-02-20 23:55:57,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {59#true} assume !(main_~a~0#1.base == 0bv32 && main_~a~0#1.offset == 0bv32); {59#true} is VALID [2022-02-20 23:55:57,648 INFO L290 TraceCheckUtils]: 3: Hoare triple {59#true} main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {59#true} is VALID [2022-02-20 23:55:57,649 INFO L290 TraceCheckUtils]: 4: Hoare triple {59#true} assume !true; {60#false} is VALID [2022-02-20 23:55:57,650 INFO L290 TraceCheckUtils]: 5: Hoare triple {60#false} assume !(1bv1 == #valid[main_~p~0#1.base]); {60#false} is VALID [2022-02-20 23:55:57,651 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:57,652 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:57,653 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:57,653 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [816118271] [2022-02-20 23:55:57,653 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [816118271] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:57,654 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:57,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:55:57,658 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235615884] [2022-02-20 23:55:57,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:57,663 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:55:57,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:57,667 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:57,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:57,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:55:57,679 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:57,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:55:57,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:55:57,709 INFO L87 Difference]: Start difference. First operand has 56 states, 31 states have (on average 2.064516129032258) internal successors, (64), 54 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:57,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:57,831 INFO L93 Difference]: Finished difference Result 56 states and 62 transitions. [2022-02-20 23:55:57,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:55:57,831 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:55:57,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:57,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:57,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2022-02-20 23:55:57,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 66 transitions. [2022-02-20 23:55:57,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 66 transitions. [2022-02-20 23:55:57,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:57,970 INFO L225 Difference]: With dead ends: 56 [2022-02-20 23:55:57,971 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 23:55:57,973 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:55:57,976 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:57,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:55:57,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 23:55:58,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-02-20 23:55:58,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:58,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,011 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,011 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:58,015 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-02-20 23:55:58,015 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-02-20 23:55:58,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:58,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:58,017 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 50 states. [2022-02-20 23:55:58,017 INFO L87 Difference]: Start difference. First operand has 50 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 50 states. [2022-02-20 23:55:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:58,020 INFO L93 Difference]: Finished difference Result 50 states and 54 transitions. [2022-02-20 23:55:58,021 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-02-20 23:55:58,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:58,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:58,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:58,022 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:58,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 28 states have (on average 1.9285714285714286) internal successors, (54), 49 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-02-20 23:55:58,026 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 6 [2022-02-20 23:55:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:58,026 INFO L470 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-02-20 23:55:58,026 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-02-20 23:55:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:55:58,027 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:58,027 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:55:58,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:55:58,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:58,238 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:55:58,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:58,239 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516519, now seen corresponding path program 1 times [2022-02-20 23:55:58,240 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:58,240 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2116858643] [2022-02-20 23:55:58,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:58,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:58,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:58,243 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:58,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:55:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:58,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:55:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:58,290 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:58,336 INFO L390 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 [2022-02-20 23:55:58,380 INFO L290 TraceCheckUtils]: 0: Hoare triple {284#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {284#true} is VALID [2022-02-20 23:55:58,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {284#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet5#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem8#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_~flag~0#1, main_~p~0#1.base, main_~p~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset;main_~flag~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;havoc main_~p~0#1.base, main_~p~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~t~0#1.base, main_~t~0#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {292#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:58,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {292#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) (_ bv1 1))} assume !(main_~a~0#1.base == 0bv32 && main_~a~0#1.offset == 0bv32); {292#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:58,383 INFO L290 TraceCheckUtils]: 3: Hoare triple {292#(= (select |#valid| |ULTIMATE.start_main_~a~0#1.base|) (_ bv1 1))} main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {299#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:58,384 INFO L290 TraceCheckUtils]: 4: Hoare triple {299#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (_ bv1 1))} assume !(0bv32 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {299#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:58,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {299#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~p~0#1.base]); {285#false} is VALID [2022-02-20 23:55:58,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:58,385 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:58,385 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:58,386 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2116858643] [2022-02-20 23:55:58,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2116858643] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:58,390 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:58,390 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:55:58,390 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711417690] [2022-02-20 23:55:58,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:58,392 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:55:58,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:58,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:58,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:55:58,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:58,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:55:58,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:55:58,402 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:58,752 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-02-20 23:55:58,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:55:58,752 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:55:58,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:58,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-02-20 23:55:58,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 73 transitions. [2022-02-20 23:55:58,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 73 transitions. [2022-02-20 23:55:58,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:58,857 INFO L225 Difference]: With dead ends: 57 [2022-02-20 23:55:58,858 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 23:55:58,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:55:58,859 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 92 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:58,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 23 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:58,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 23:55:58,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 52. [2022-02-20 23:55:58,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:58,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 52 states, 35 states have (on average 1.8) internal successors, (63), 51 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,864 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 52 states, 35 states have (on average 1.8) internal successors, (63), 51 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,865 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 52 states, 35 states have (on average 1.8) internal successors, (63), 51 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:58,870 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-02-20 23:55:58,870 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-02-20 23:55:58,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:58,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:58,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 35 states have (on average 1.8) internal successors, (63), 51 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 57 states. [2022-02-20 23:55:58,872 INFO L87 Difference]: Start difference. First operand has 52 states, 35 states have (on average 1.8) internal successors, (63), 51 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 57 states. [2022-02-20 23:55:58,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:58,875 INFO L93 Difference]: Finished difference Result 57 states and 63 transitions. [2022-02-20 23:55:58,875 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 63 transitions. [2022-02-20 23:55:58,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:58,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:58,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:58,876 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:58,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 35 states have (on average 1.8) internal successors, (63), 51 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 63 transitions. [2022-02-20 23:55:58,879 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 63 transitions. Word has length 6 [2022-02-20 23:55:58,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:58,879 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 63 transitions. [2022-02-20 23:55:58,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:58,880 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 63 transitions. [2022-02-20 23:55:58,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:55:58,880 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:58,880 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:55:58,891 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:55:59,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:59,089 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:55:59,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:59,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1037516520, now seen corresponding path program 1 times [2022-02-20 23:55:59,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:59,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1325232439] [2022-02-20 23:55:59,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:59,091 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:59,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:59,092 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:59,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:55:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:59,132 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:55:59,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:59,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:59,154 INFO L390 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 [2022-02-20 23:55:59,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {530#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {530#true} is VALID [2022-02-20 23:55:59,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {530#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet3#1, main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet5#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem8#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem10#1, main_#t~mem12#1, main_~flag~0#1, main_~p~0#1.base, main_~p~0#1.offset, main_~a~0#1.base, main_~a~0#1.offset, main_~t~0#1.base, main_~t~0#1.offset;main_~flag~0#1 := main_#t~nondet3#1;havoc main_#t~nondet3#1;havoc main_~p~0#1.base, main_~p~0#1.offset;havoc main_~a~0#1.base, main_~a~0#1.offset;havoc main_~t~0#1.base, main_~t~0#1.offset;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {538#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:59,208 INFO L290 TraceCheckUtils]: 2: Hoare triple {538#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)))} assume !(main_~a~0#1.base == 0bv32 && main_~a~0#1.offset == 0bv32); {538#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:59,208 INFO L290 TraceCheckUtils]: 3: Hoare triple {538#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~a~0#1.base|)) (= |ULTIMATE.start_main_~a~0#1.offset| (_ bv0 32)))} main_~p~0#1.base, main_~p~0#1.offset := main_~a~0#1.base, main_~a~0#1.offset; {545#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:59,209 INFO L290 TraceCheckUtils]: 4: Hoare triple {545#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))} assume !(0bv32 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {545#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:59,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {545#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_~p~0#1.offset), #length[main_~p~0#1.base]) && ~bvule32(main_~p~0#1.offset, ~bvadd32(4bv32, main_~p~0#1.offset))) && ~bvule32(0bv32, main_~p~0#1.offset)); {531#false} is VALID [2022-02-20 23:55:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:59,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:59,211 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:59,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1325232439] [2022-02-20 23:55:59,211 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1325232439] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:59,211 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:59,211 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:55:59,212 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413264238] [2022-02-20 23:55:59,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:59,212 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:55:59,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:59,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:59,220 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:59,220 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:55:59,220 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:59,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:55:59,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:55:59,221 INFO L87 Difference]: Start difference. First operand 52 states and 63 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:59,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:59,659 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-02-20 23:55:59,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:55:59,659 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:55:59,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-02-20 23:55:59,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-02-20 23:55:59,663 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-02-20 23:55:59,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:59,787 INFO L225 Difference]: With dead ends: 70 [2022-02-20 23:55:59,788 INFO L226 Difference]: Without dead ends: 70 [2022-02-20 23:55:59,788 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:55:59,789 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 95 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:59,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 38 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:55:59,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-20 23:55:59,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 61. [2022-02-20 23:55:59,793 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:59,793 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 61 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:59,793 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 61 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:59,794 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 61 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:59,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:59,796 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-02-20 23:55:59,796 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-02-20 23:55:59,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:59,797 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:59,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 70 states. [2022-02-20 23:55:59,797 INFO L87 Difference]: Start difference. First operand has 61 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 70 states. [2022-02-20 23:55:59,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:59,800 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-02-20 23:55:59,800 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-02-20 23:55:59,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:59,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:59,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:59,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:59,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 44 states have (on average 1.5681818181818181) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:59,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-02-20 23:55:59,803 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 6 [2022-02-20 23:55:59,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:59,803 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-02-20 23:55:59,803 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:59,804 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-02-20 23:55:59,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:55:59,804 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:59,804 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:59,817 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:56:00,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:56:00,018 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 18 more)] === [2022-02-20 23:56:00,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:56:00,018 INFO L85 PathProgramCache]: Analyzing trace with hash 1015119333, now seen corresponding path program 1 times [2022-02-20 23:56:00,019 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:56:00,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911984828] [2022-02-20 23:56:00,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:56:00,019 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:56:00,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:56:00,020 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:56:00,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:56:00,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:56:00,075 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:56:00,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:56:00,113 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 23:56:00,113 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:56:00,114 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_LEAK (21 of 22 remaining) [2022-02-20 23:56:00,116 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (20 of 22 remaining) [2022-02-20 23:56:00,116 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (19 of 22 remaining) [2022-02-20 23:56:00,116 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (18 of 22 remaining) [2022-02-20 23:56:00,116 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (17 of 22 remaining) [2022-02-20 23:56:00,116 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (16 of 22 remaining) [2022-02-20 23:56:00,116 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (15 of 22 remaining) [2022-02-20 23:56:00,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (14 of 22 remaining) [2022-02-20 23:56:00,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (13 of 22 remaining) [2022-02-20 23:56:00,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (12 of 22 remaining) [2022-02-20 23:56:00,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (11 of 22 remaining) [2022-02-20 23:56:00,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (10 of 22 remaining) [2022-02-20 23:56:00,117 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (9 of 22 remaining) [2022-02-20 23:56:00,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (8 of 22 remaining) [2022-02-20 23:56:00,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (7 of 22 remaining) [2022-02-20 23:56:00,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (6 of 22 remaining) [2022-02-20 23:56:00,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (5 of 22 remaining) [2022-02-20 23:56:00,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (4 of 22 remaining) [2022-02-20 23:56:00,118 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (3 of 22 remaining) [2022-02-20 23:56:00,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (2 of 22 remaining) [2022-02-20 23:56:00,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (1 of 22 remaining) [2022-02-20 23:56:00,119 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK (0 of 22 remaining) [2022-02-20 23:56:00,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-20 23:56:00,319 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:56:00,322 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-02-20 23:56:00,324 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:56:00,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:56:00 BoogieIcfgContainer [2022-02-20 23:56:00,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:56:00,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:56:00,353 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:56:00,353 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:56:00,353 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:55:57" (3/4) ... [2022-02-20 23:56:00,355 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-20 23:56:00,356 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:56:00,357 INFO L158 Benchmark]: Toolchain (without parser) took 4085.91ms. Allocated memory was 54.5MB in the beginning and 81.8MB in the end (delta: 27.3MB). Free memory was 30.3MB in the beginning and 54.1MB in the end (delta: -23.9MB). Peak memory consumption was 4.7MB. Max. memory is 16.1GB. [2022-02-20 23:56:00,357 INFO L158 Benchmark]: CDTParser took 0.26ms. Allocated memory is still 54.5MB. Free memory was 36.4MB in the beginning and 36.4MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:56:00,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.41ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 30.1MB in the beginning and 41.0MB in the end (delta: -10.9MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. [2022-02-20 23:56:00,358 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.61ms. Allocated memory is still 67.1MB. Free memory was 41.0MB in the beginning and 38.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:56:00,358 INFO L158 Benchmark]: Boogie Preprocessor took 33.45ms. Allocated memory is still 67.1MB. Free memory was 38.7MB in the beginning and 36.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:56:00,359 INFO L158 Benchmark]: RCFGBuilder took 598.97ms. Allocated memory is still 67.1MB. Free memory was 36.8MB in the beginning and 37.5MB in the end (delta: -735.1kB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2022-02-20 23:56:00,359 INFO L158 Benchmark]: TraceAbstraction took 2974.33ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 37.0MB in the beginning and 54.7MB in the end (delta: -17.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:56:00,359 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 81.8MB. Free memory was 54.7MB in the beginning and 54.1MB in the end (delta: 583.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:56:00,361 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.26ms. Allocated memory is still 54.5MB. Free memory was 36.4MB in the beginning and 36.4MB in the end (delta: 46.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.41ms. Allocated memory was 54.5MB in the beginning and 67.1MB in the end (delta: 12.6MB). Free memory was 30.1MB in the beginning and 41.0MB in the end (delta: -10.9MB). Peak memory consumption was 7.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.61ms. Allocated memory is still 67.1MB. Free memory was 41.0MB in the beginning and 38.7MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.45ms. Allocated memory is still 67.1MB. Free memory was 38.7MB in the beginning and 36.8MB in the end (delta: 1.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 598.97ms. Allocated memory is still 67.1MB. Free memory was 36.8MB in the beginning and 37.5MB in the end (delta: -735.1kB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2974.33ms. Allocated memory was 67.1MB in the beginning and 81.8MB in the end (delta: 14.7MB). Free memory was 37.0MB in the beginning and 54.7MB in the end (delta: -17.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 81.8MB. Free memory was 54.7MB in the beginning and 54.1MB in the end (delta: 583.9kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 531]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 531. Possible FailurePath: [L532] int flag = __VERIFIER_nondet_int(); [L533] List p, a, t; [L534] a = (List) malloc(sizeof(struct node)) [L535] COND FALSE !(a == 0) VAL [a={6:0}] [L536] p = a VAL [a={6:0}, p={6:0}] [L537] COND FALSE !(__VERIFIER_nondet_int()) [L548] p->h = 3 VAL [a={6:0}, p={6:0}] [L549] p = a VAL [a={6:0}, p={6:0}] [L550] COND FALSE !(\read(flag)) VAL [a={6:0}, flag=0, p={6:0}] [L554] EXPR p->h VAL [a={6:0}, flag=0, p={6:0}, p->h=3] [L554] COND FALSE !(p->h == 2) [L556] EXPR p->h VAL [a={6:0}, flag=0, p={6:0}, p->h=3] [L556] COND FALSE !(p->h != 3) - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 539]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 541]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 545]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 546]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 546]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 548]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 551]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 552]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 554]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 555]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 556]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 557]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 22 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 187 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 187 mSDsluCounter, 123 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 33 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 104 IncrementalHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 33 mSolverCounterUnsat, 106 mSDtfsCounter, 104 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 14 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 31 NumberOfCodeBlocks, 31 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 63 SizeOfPredicates, 3 NumberOfNonLiveVariables, 81 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: 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 [2022-02-20 23:56:00,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample