./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/sll-optional-2.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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/forester-heap/sll-optional-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 88a09c8f9046119952ab983278979c8bac528a0f4e69aababe99c00b4eccdca0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:36:39,790 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:36:39,792 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:36:39,818 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:36:39,821 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:36:39,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:36:39,825 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:36:39,828 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:36:39,830 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:36:39,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:36:39,834 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:36:39,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:36:39,835 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:36:39,836 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:36:39,838 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:36:39,839 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:36:39,839 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:36:39,840 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:36:39,843 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:36:39,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:36:39,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:36:39,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:36:39,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:36:39,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:36:39,855 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:36:39,855 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:36:39,855 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:36:39,856 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:36:39,857 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:36:39,857 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:36:39,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:36:39,858 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:36:39,860 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:36:39,860 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:36:39,861 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:36:39,861 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:36:39,862 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:36:39,862 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:36:39,863 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:36:39,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:36:39,863 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:36:39,864 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-02-20 23:36:39,884 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:36:39,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:36:39,886 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:36:39,886 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:36:39,886 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:36:39,886 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:36:39,887 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:36:39,887 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:36:39,887 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:36:39,887 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:36:39,888 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:36:39,888 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:36:39,888 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:36:39,888 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:36:39,888 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:36:39,889 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:36:39,889 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:36:39,889 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:36:39,889 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:36:39,889 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:36:39,889 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:36:39,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:36:39,890 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:36:39,890 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:36:39,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:36:39,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:36:39,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:36:39,891 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:36:39,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:36:39,892 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-memcleanup) ) 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 -> 88a09c8f9046119952ab983278979c8bac528a0f4e69aababe99c00b4eccdca0 [2022-02-20 23:36:40,062 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:36:40,084 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:36:40,086 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:36:40,087 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:36:40,088 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:36:40,089 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/sll-optional-2.i [2022-02-20 23:36:40,147 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5525b8def/20529e7608ec4256951513cae77aacf4/FLAG8ff9b985f [2022-02-20 23:36:40,522 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:36:40,523 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/sll-optional-2.i [2022-02-20 23:36:40,532 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5525b8def/20529e7608ec4256951513cae77aacf4/FLAG8ff9b985f [2022-02-20 23:36:40,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5525b8def/20529e7608ec4256951513cae77aacf4 [2022-02-20 23:36:40,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:36:40,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:36:40,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:36:40,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:36:40,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:36:40,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:36:40" (1/1) ... [2022-02-20 23:36:40,552 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@201ba300 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:40, skipping insertion in model container [2022-02-20 23:36:40,552 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:36:40" (1/1) ... [2022-02-20 23:36:40,557 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:36:40,585 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:36:40,760 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/forester-heap/sll-optional-2.i[22641,22654] [2022-02-20 23:36:40,764 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:36:40,769 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:36:40,807 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/forester-heap/sll-optional-2.i[22641,22654] [2022-02-20 23:36:40,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:36:40,831 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:36:40,831 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:40 WrapperNode [2022-02-20 23:36:40,831 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:36:40,832 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:36:40,832 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:36:40,832 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:36:40,837 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:36:40" (1/1) ... [2022-02-20 23:36:40,851 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:36:40" (1/1) ... [2022-02-20 23:36:40,872 INFO L137 Inliner]: procedures = 119, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 117 [2022-02-20 23:36:40,872 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:36:40,873 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:36:40,873 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:36:40,873 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:36:40,878 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:40" (1/1) ... [2022-02-20 23:36:40,878 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:40" (1/1) ... [2022-02-20 23:36:40,880 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:40" (1/1) ... [2022-02-20 23:36:40,880 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:40" (1/1) ... [2022-02-20 23:36:40,887 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:40" (1/1) ... [2022-02-20 23:36:40,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:40" (1/1) ... [2022-02-20 23:36:40,904 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:40" (1/1) ... [2022-02-20 23:36:40,906 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:36:40,907 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:36:40,912 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:36:40,912 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:36:40,913 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:40" (1/1) ... [2022-02-20 23:36:40,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:36:40,938 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:36:40,947 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:36:40,959 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:36:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:36:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:36:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:36:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:36:40,974 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:36:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:36:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:36:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:36:40,975 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:36:40,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:36:41,042 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:36:41,044 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:36:41,422 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:36:41,427 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:36:41,427 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 23:36:41,429 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:36:41 BoogieIcfgContainer [2022-02-20 23:36:41,429 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:36:41,436 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:36:41,437 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:36:41,439 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:36:41,439 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:36:40" (1/3) ... [2022-02-20 23:36:41,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6232dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:36:41, skipping insertion in model container [2022-02-20 23:36:41,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:40" (2/3) ... [2022-02-20 23:36:41,440 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6232dc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:36:41, skipping insertion in model container [2022-02-20 23:36:41,440 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:36:41" (3/3) ... [2022-02-20 23:36:41,441 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-optional-2.i [2022-02-20 23:36:41,444 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:36:41,445 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 60 error locations. [2022-02-20 23:36:41,476 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:36:41,481 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:36:41,481 INFO L340 AbstractCegarLoop]: Starting to check reachability of 60 error locations. [2022-02-20 23:36:41,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 128 states, 67 states have (on average 2.1194029850746268) internal successors, (142), 127 states have internal predecessors, (142), 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:36:41,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:36:41,503 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:41,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:36:41,504 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2022-02-20 23:36:41,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:41,507 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:36:41,513 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:41,513 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094448766] [2022-02-20 23:36:41,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:41,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:41,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {131#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(17, 2); {131#true} is VALID [2022-02-20 23:36:41,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {131#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~nondet6#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {133#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:41,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {133#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} assume !(1 == #valid[main_~head~0#1.base]); {132#false} is VALID [2022-02-20 23:36:41,629 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:36:41,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:41,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094448766] [2022-02-20 23:36:41,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094448766] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:41,630 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:41,631 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:36:41,632 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763788585] [2022-02-20 23:36:41,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:41,635 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-02-20 23:36:41,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:41,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:41,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:41,643 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:41,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:41,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:41,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:41,666 INFO L87 Difference]: Start difference. First operand has 128 states, 67 states have (on average 2.1194029850746268) internal successors, (142), 127 states have internal predecessors, (142), 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 has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:41,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:41,894 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2022-02-20 23:36:41,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:41,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-02-20 23:36:41,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:41,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:41,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2022-02-20 23:36:41,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:41,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2022-02-20 23:36:41,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2022-02-20 23:36:42,016 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:42,028 INFO L225 Difference]: With dead ends: 130 [2022-02-20 23:36:42,028 INFO L226 Difference]: Without dead ends: 126 [2022-02-20 23:36:42,030 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:42,033 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 111 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:42,037 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 73 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:42,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-20 23:36:42,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 120. [2022-02-20 23:36:42,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:42,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 120 states, 69 states have (on average 1.8840579710144927) internal successors, (130), 119 states have internal predecessors, (130), 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:36:42,075 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 120 states, 69 states have (on average 1.8840579710144927) internal successors, (130), 119 states have internal predecessors, (130), 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:36:42,075 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 120 states, 69 states have (on average 1.8840579710144927) internal successors, (130), 119 states have internal predecessors, (130), 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:36:42,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:42,088 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2022-02-20 23:36:42,088 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2022-02-20 23:36:42,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:42,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:42,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 69 states have (on average 1.8840579710144927) internal successors, (130), 119 states have internal predecessors, (130), 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 126 states. [2022-02-20 23:36:42,090 INFO L87 Difference]: Start difference. First operand has 120 states, 69 states have (on average 1.8840579710144927) internal successors, (130), 119 states have internal predecessors, (130), 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 126 states. [2022-02-20 23:36:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:42,096 INFO L93 Difference]: Finished difference Result 126 states and 134 transitions. [2022-02-20 23:36:42,096 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 134 transitions. [2022-02-20 23:36:42,100 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:42,100 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:42,100 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:42,100 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:42,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 69 states have (on average 1.8840579710144927) internal successors, (130), 119 states have internal predecessors, (130), 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:36:42,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 130 transitions. [2022-02-20 23:36:42,104 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 130 transitions. Word has length 3 [2022-02-20 23:36:42,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:42,105 INFO L470 AbstractCegarLoop]: Abstraction has 120 states and 130 transitions. [2022-02-20 23:36:42,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:42,105 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2022-02-20 23:36:42,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:36:42,105 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:42,106 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:36:42,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:36:42,107 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2022-02-20 23:36:42,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:42,109 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:36:42,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:42,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108376424] [2022-02-20 23:36:42,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:42,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:42,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:42,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {638#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(17, 2); {638#true} is VALID [2022-02-20 23:36:42,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {638#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~nondet6#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {640#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:36:42,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {640#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} assume !(4 + main_~head~0#1.offset <= #length[main_~head~0#1.base] && 0 <= main_~head~0#1.offset); {639#false} is VALID [2022-02-20 23:36:42,189 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:36:42,190 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:42,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108376424] [2022-02-20 23:36:42,190 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108376424] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:42,191 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:42,191 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:36:42,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818817768] [2022-02-20 23:36:42,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:42,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-02-20 23:36:42,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:42,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:42,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:42,198 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:42,198 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:42,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:42,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:42,199 INFO L87 Difference]: Start difference. First operand 120 states and 130 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:42,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:42,385 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2022-02-20 23:36:42,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:42,390 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 3 [2022-02-20 23:36:42,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:42,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:42,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-20 23:36:42,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:42,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-20 23:36:42,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 129 transitions. [2022-02-20 23:36:42,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:42,498 INFO L225 Difference]: With dead ends: 116 [2022-02-20 23:36:42,498 INFO L226 Difference]: Without dead ends: 116 [2022-02-20 23:36:42,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:42,502 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 88 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:42,503 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 86 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:42,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-02-20 23:36:42,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 112. [2022-02-20 23:36:42,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:42,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 112 states, 69 states have (on average 1.7681159420289856) internal successors, (122), 111 states have internal predecessors, (122), 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:36:42,510 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 112 states, 69 states have (on average 1.7681159420289856) internal successors, (122), 111 states have internal predecessors, (122), 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:36:42,511 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 112 states, 69 states have (on average 1.7681159420289856) internal successors, (122), 111 states have internal predecessors, (122), 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:36:42,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:42,513 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2022-02-20 23:36:42,513 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2022-02-20 23:36:42,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:42,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:42,514 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 69 states have (on average 1.7681159420289856) internal successors, (122), 111 states have internal predecessors, (122), 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 116 states. [2022-02-20 23:36:42,515 INFO L87 Difference]: Start difference. First operand has 112 states, 69 states have (on average 1.7681159420289856) internal successors, (122), 111 states have internal predecessors, (122), 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 116 states. [2022-02-20 23:36:42,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:42,518 INFO L93 Difference]: Finished difference Result 116 states and 126 transitions. [2022-02-20 23:36:42,518 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 126 transitions. [2022-02-20 23:36:42,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:42,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:42,519 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:42,519 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:42,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 69 states have (on average 1.7681159420289856) internal successors, (122), 111 states have internal predecessors, (122), 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:36:42,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 122 transitions. [2022-02-20 23:36:42,521 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 122 transitions. Word has length 3 [2022-02-20 23:36:42,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:42,522 INFO L470 AbstractCegarLoop]: Abstraction has 112 states and 122 transitions. [2022-02-20 23:36:42,522 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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:36:42,522 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 122 transitions. [2022-02-20 23:36:42,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:36:42,522 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:42,522 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:42,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:36:42,522 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2022-02-20 23:36:42,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:42,523 INFO L85 PathProgramCache]: Analyzing trace with hash 171916845, now seen corresponding path program 1 times [2022-02-20 23:36:42,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:42,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1587078109] [2022-02-20 23:36:42,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:42,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:42,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:42,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {1103#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(17, 2); {1103#true} is VALID [2022-02-20 23:36:42,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {1103#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~nondet6#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {1103#true} is VALID [2022-02-20 23:36:42,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {1103#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {1103#true} is VALID [2022-02-20 23:36:42,574 INFO L290 TraceCheckUtils]: 3: Hoare triple {1103#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1103#true} is VALID [2022-02-20 23:36:42,575 INFO L290 TraceCheckUtils]: 4: Hoare triple {1103#true} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {1103#true} is VALID [2022-02-20 23:36:42,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {1103#true} SUMMARY for call write~int(2, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L998-1 {1103#true} is VALID [2022-02-20 23:36:42,575 INFO L290 TraceCheckUtils]: 6: Hoare triple {1103#true} call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {1105#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} is VALID [2022-02-20 23:36:42,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {1105#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-3 {1106#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:36:42,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {1106#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 1)} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1106#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:36:42,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {1106#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4))) 1)} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-5 {1107#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} is VALID [2022-02-20 23:36:42,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {1107#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} assume !(1 == #valid[main_#t~mem4#1.base]); {1104#false} is VALID [2022-02-20 23:36:42,578 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:36:42,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:42,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1587078109] [2022-02-20 23:36:42,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1587078109] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:42,579 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:42,579 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:42,579 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388933570] [2022-02-20 23:36:42,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:42,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2022-02-20 23:36:42,580 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:42,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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:36:42,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:42,587 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:36:42,588 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:42,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:36:42,588 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:42,588 INFO L87 Difference]: Start difference. First operand 112 states and 122 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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:36:42,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:42,937 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2022-02-20 23:36:42,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:36:42,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2022-02-20 23:36:42,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:42,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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:36:42,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2022-02-20 23:36:42,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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:36:42,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 150 transitions. [2022-02-20 23:36:42,941 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 150 transitions. [2022-02-20 23:36:43,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:43,035 INFO L225 Difference]: With dead ends: 141 [2022-02-20 23:36:43,035 INFO L226 Difference]: Without dead ends: 141 [2022-02-20 23:36:43,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:36:43,036 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 34 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:43,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 269 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:43,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-02-20 23:36:43,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 111. [2022-02-20 23:36:43,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:43,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 111 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 110 states have internal predecessors, (121), 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:36:43,040 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 111 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 110 states have internal predecessors, (121), 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:36:43,040 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 111 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 110 states have internal predecessors, (121), 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:36:43,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:43,044 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2022-02-20 23:36:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2022-02-20 23:36:43,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:43,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:43,045 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 110 states have internal predecessors, (121), 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 141 states. [2022-02-20 23:36:43,045 INFO L87 Difference]: Start difference. First operand has 111 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 110 states have internal predecessors, (121), 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 141 states. [2022-02-20 23:36:43,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:43,048 INFO L93 Difference]: Finished difference Result 141 states and 154 transitions. [2022-02-20 23:36:43,048 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 154 transitions. [2022-02-20 23:36:43,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:43,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:43,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:43,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:43,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 110 states have internal predecessors, (121), 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:36:43,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 121 transitions. [2022-02-20 23:36:43,051 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 121 transitions. Word has length 11 [2022-02-20 23:36:43,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:43,051 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 121 transitions. [2022-02-20 23:36:43,051 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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:36:43,052 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 121 transitions. [2022-02-20 23:36:43,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:36:43,052 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:43,052 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:43,052 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:36:43,052 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2022-02-20 23:36:43,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:43,052 INFO L85 PathProgramCache]: Analyzing trace with hash 171916846, now seen corresponding path program 1 times [2022-02-20 23:36:43,053 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:43,053 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29936162] [2022-02-20 23:36:43,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:43,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:43,160 INFO L290 TraceCheckUtils]: 0: Hoare triple {1648#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(17, 2); {1648#true} is VALID [2022-02-20 23:36:43,160 INFO L290 TraceCheckUtils]: 1: Hoare triple {1648#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~nondet6#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {1648#true} is VALID [2022-02-20 23:36:43,160 INFO L290 TraceCheckUtils]: 2: Hoare triple {1648#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {1648#true} is VALID [2022-02-20 23:36:43,161 INFO L290 TraceCheckUtils]: 3: Hoare triple {1648#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1648#true} is VALID [2022-02-20 23:36:43,161 INFO L290 TraceCheckUtils]: 4: Hoare triple {1648#true} assume 0 != main_#t~nondet2#1;havoc main_#t~nondet2#1; {1648#true} is VALID [2022-02-20 23:36:43,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {1648#true} SUMMARY for call write~int(2, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L998-1 {1648#true} is VALID [2022-02-20 23:36:43,162 INFO L290 TraceCheckUtils]: 6: Hoare triple {1648#true} call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {1650#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|)))} is VALID [2022-02-20 23:36:43,162 INFO L290 TraceCheckUtils]: 7: Hoare triple {1650#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-3 {1651#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)))))} is VALID [2022-02-20 23:36:43,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {1651#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)))))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {1651#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)))))} is VALID [2022-02-20 23:36:43,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {1651#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) (+ |ULTIMATE.start_main_~head~0#1.offset| 4)))))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-5 {1652#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)))} is VALID [2022-02-20 23:36:43,164 INFO L290 TraceCheckUtils]: 10: Hoare triple {1652#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)))} assume !(4 + main_#t~mem4#1.offset <= #length[main_#t~mem4#1.base] && 0 <= main_#t~mem4#1.offset); {1649#false} is VALID [2022-02-20 23:36:43,164 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:36:43,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:43,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29936162] [2022-02-20 23:36:43,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29936162] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:43,165 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:43,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:43,165 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1254762502] [2022-02-20 23:36:43,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:43,166 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2022-02-20 23:36:43,166 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:43,166 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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:36:43,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:43,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:36:43,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:43,175 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:36:43,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:43,175 INFO L87 Difference]: Start difference. First operand 111 states and 121 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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:36:43,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:43,519 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2022-02-20 23:36:43,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:36:43,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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 11 [2022-02-20 23:36:43,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:43,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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:36:43,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2022-02-20 23:36:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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:36:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 116 transitions. [2022-02-20 23:36:43,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 116 transitions. [2022-02-20 23:36:43,608 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:43,610 INFO L225 Difference]: With dead ends: 110 [2022-02-20 23:36:43,610 INFO L226 Difference]: Without dead ends: 110 [2022-02-20 23:36:43,610 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:36:43,611 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:43,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 299 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:43,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-02-20 23:36:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-02-20 23:36:43,614 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:43,614 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 69 states have (on average 1.7391304347826086) internal successors, (120), 109 states have internal predecessors, (120), 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:36:43,614 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 69 states have (on average 1.7391304347826086) internal successors, (120), 109 states have internal predecessors, (120), 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:36:43,615 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 69 states have (on average 1.7391304347826086) internal successors, (120), 109 states have internal predecessors, (120), 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:36:43,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:43,616 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2022-02-20 23:36:43,617 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-02-20 23:36:43,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:43,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:43,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 69 states have (on average 1.7391304347826086) internal successors, (120), 109 states have internal predecessors, (120), 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 110 states. [2022-02-20 23:36:43,617 INFO L87 Difference]: Start difference. First operand has 110 states, 69 states have (on average 1.7391304347826086) internal successors, (120), 109 states have internal predecessors, (120), 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 110 states. [2022-02-20 23:36:43,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:43,619 INFO L93 Difference]: Finished difference Result 110 states and 120 transitions. [2022-02-20 23:36:43,619 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-02-20 23:36:43,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:43,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:43,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:43,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:43,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 69 states have (on average 1.7391304347826086) internal successors, (120), 109 states have internal predecessors, (120), 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:36:43,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 120 transitions. [2022-02-20 23:36:43,622 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 120 transitions. Word has length 11 [2022-02-20 23:36:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:43,622 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 120 transitions. [2022-02-20 23:36:43,623 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 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:36:43,623 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 120 transitions. [2022-02-20 23:36:43,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:36:43,623 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:43,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:43,623 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:36:43,623 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2022-02-20 23:36:43,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:43,624 INFO L85 PathProgramCache]: Analyzing trace with hash -468215045, now seen corresponding path program 1 times [2022-02-20 23:36:43,624 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:43,624 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406875127] [2022-02-20 23:36:43,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:43,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:43,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:43,683 INFO L290 TraceCheckUtils]: 0: Hoare triple {2099#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(17, 2); {2099#true} is VALID [2022-02-20 23:36:43,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {2099#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~nondet6#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {2101#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {2101#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {2101#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {2101#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {2101#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,685 INFO L290 TraceCheckUtils]: 4: Hoare triple {2101#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {2101#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {2101#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {2101#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {2101#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L998-13 {2101#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {2101#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-14 {2101#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {2101#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {2102#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,687 INFO L290 TraceCheckUtils]: 9: Hoare triple {2102#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {2102#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,688 INFO L290 TraceCheckUtils]: 10: Hoare triple {2102#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(12); {2102#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:43,688 INFO L290 TraceCheckUtils]: 11: Hoare triple {2102#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {2100#false} is VALID [2022-02-20 23:36:43,689 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:36:43,689 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:43,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406875127] [2022-02-20 23:36:43,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406875127] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:43,689 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:43,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:36:43,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117719870] [2022-02-20 23:36:43,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:43,690 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2022-02-20 23:36:43,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:43,691 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:36:43,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:43,698 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:36:43,698 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:43,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:36:43,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:36:43,699 INFO L87 Difference]: Start difference. First operand 110 states and 120 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:36:43,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:43,917 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-02-20 23:36:43,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:36:43,917 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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 12 [2022-02-20 23:36:43,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:36:43,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2022-02-20 23:36:43,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:36:43,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 137 transitions. [2022-02-20 23:36:43,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 137 transitions. [2022-02-20 23:36:44,005 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:44,006 INFO L225 Difference]: With dead ends: 114 [2022-02-20 23:36:44,006 INFO L226 Difference]: Without dead ends: 114 [2022-02-20 23:36:44,007 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:36:44,007 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 141 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:44,007 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 65 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:44,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-02-20 23:36:44,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 105. [2022-02-20 23:36:44,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:44,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 105 states, 75 states have (on average 1.6) internal successors, (120), 104 states have internal predecessors, (120), 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:36:44,011 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 105 states, 75 states have (on average 1.6) internal successors, (120), 104 states have internal predecessors, (120), 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:36:44,011 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 105 states, 75 states have (on average 1.6) internal successors, (120), 104 states have internal predecessors, (120), 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:36:44,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:44,013 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-02-20 23:36:44,013 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2022-02-20 23:36:44,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:44,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:44,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 75 states have (on average 1.6) internal successors, (120), 104 states have internal predecessors, (120), 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 114 states. [2022-02-20 23:36:44,014 INFO L87 Difference]: Start difference. First operand has 105 states, 75 states have (on average 1.6) internal successors, (120), 104 states have internal predecessors, (120), 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 114 states. [2022-02-20 23:36:44,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:44,015 INFO L93 Difference]: Finished difference Result 114 states and 123 transitions. [2022-02-20 23:36:44,016 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 123 transitions. [2022-02-20 23:36:44,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:44,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:44,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:44,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:44,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.6) internal successors, (120), 104 states have internal predecessors, (120), 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:36:44,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 120 transitions. [2022-02-20 23:36:44,018 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 120 transitions. Word has length 12 [2022-02-20 23:36:44,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:44,018 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 120 transitions. [2022-02-20 23:36:44,018 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 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:36:44,018 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 120 transitions. [2022-02-20 23:36:44,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:36:44,019 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:44,019 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:44,019 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:36:44,019 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2022-02-20 23:36:44,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:44,019 INFO L85 PathProgramCache]: Analyzing trace with hash -468215044, now seen corresponding path program 1 times [2022-02-20 23:36:44,020 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:44,020 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801766126] [2022-02-20 23:36:44,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:44,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:44,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:44,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {2554#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(17, 2); {2554#true} is VALID [2022-02-20 23:36:44,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {2554#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~nondet6#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {2556#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:36:44,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {2556#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {2557#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:36:44,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {2557#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {2557#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:36:44,105 INFO L290 TraceCheckUtils]: 4: Hoare triple {2557#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {2557#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:36:44,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {2557#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {2557#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:36:44,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {2557#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L998-13 {2557#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:36:44,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {2557#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-14 {2557#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:36:44,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {2557#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {2558#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} is VALID [2022-02-20 23:36:44,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {2558#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {2558#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} is VALID [2022-02-20 23:36:44,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {2558#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} assume !!(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(12); {2559#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:36:44,111 INFO L290 TraceCheckUtils]: 11: Hoare triple {2559#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume !(4 + main_~x~0#1.offset <= #length[main_~x~0#1.base] && 0 <= main_~x~0#1.offset); {2555#false} is VALID [2022-02-20 23:36:44,111 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:36:44,111 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:44,112 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801766126] [2022-02-20 23:36:44,112 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801766126] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:44,112 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:44,112 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:36:44,112 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146342291] [2022-02-20 23:36:44,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:44,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2022-02-20 23:36:44,113 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:44,113 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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:36:44,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:44,121 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:36:44,121 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:44,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:36:44,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:36:44,122 INFO L87 Difference]: Start difference. First operand 105 states and 120 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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:36:44,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:44,584 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2022-02-20 23:36:44,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:36:44,584 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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 12 [2022-02-20 23:36:44,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:44,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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:36:44,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2022-02-20 23:36:44,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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:36:44,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 166 transitions. [2022-02-20 23:36:44,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 166 transitions. [2022-02-20 23:36:44,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:44,700 INFO L225 Difference]: With dead ends: 147 [2022-02-20 23:36:44,700 INFO L226 Difference]: Without dead ends: 147 [2022-02-20 23:36:44,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:36:44,701 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 139 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 232 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:44,701 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 130 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 232 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:36:44,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-02-20 23:36:44,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 124. [2022-02-20 23:36:44,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:44,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 124 states, 94 states have (on average 1.5212765957446808) internal successors, (143), 123 states have internal predecessors, (143), 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:36:44,706 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 124 states, 94 states have (on average 1.5212765957446808) internal successors, (143), 123 states have internal predecessors, (143), 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:36:44,706 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 124 states, 94 states have (on average 1.5212765957446808) internal successors, (143), 123 states have internal predecessors, (143), 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:36:44,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:44,708 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2022-02-20 23:36:44,708 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2022-02-20 23:36:44,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:44,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:44,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 94 states have (on average 1.5212765957446808) internal successors, (143), 123 states have internal predecessors, (143), 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 147 states. [2022-02-20 23:36:44,709 INFO L87 Difference]: Start difference. First operand has 124 states, 94 states have (on average 1.5212765957446808) internal successors, (143), 123 states have internal predecessors, (143), 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 147 states. [2022-02-20 23:36:44,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:44,711 INFO L93 Difference]: Finished difference Result 147 states and 161 transitions. [2022-02-20 23:36:44,712 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 161 transitions. [2022-02-20 23:36:44,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:44,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:44,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:44,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:44,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 94 states have (on average 1.5212765957446808) internal successors, (143), 123 states have internal predecessors, (143), 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:36:44,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 143 transitions. [2022-02-20 23:36:44,714 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 143 transitions. Word has length 12 [2022-02-20 23:36:44,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:44,714 INFO L470 AbstractCegarLoop]: Abstraction has 124 states and 143 transitions. [2022-02-20 23:36:44,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 6 states have internal predecessors, (12), 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:36:44,715 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2022-02-20 23:36:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:36:44,715 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:44,715 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:44,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:36:44,715 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2022-02-20 23:36:44,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:44,716 INFO L85 PathProgramCache]: Analyzing trace with hash -2003220227, now seen corresponding path program 1 times [2022-02-20 23:36:44,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:44,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038263018] [2022-02-20 23:36:44,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:44,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:44,779 INFO L290 TraceCheckUtils]: 0: Hoare triple {3129#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(17, 2); {3129#true} is VALID [2022-02-20 23:36:44,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {3129#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~nondet6#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {3129#true} is VALID [2022-02-20 23:36:44,780 INFO L290 TraceCheckUtils]: 2: Hoare triple {3129#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {3129#true} is VALID [2022-02-20 23:36:44,780 INFO L290 TraceCheckUtils]: 3: Hoare triple {3129#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {3129#true} is VALID [2022-02-20 23:36:44,782 INFO L290 TraceCheckUtils]: 4: Hoare triple {3129#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {3129#true} is VALID [2022-02-20 23:36:44,782 INFO L290 TraceCheckUtils]: 5: Hoare triple {3129#true} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {3129#true} is VALID [2022-02-20 23:36:44,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {3129#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L998-13 {3129#true} is VALID [2022-02-20 23:36:44,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {3129#true} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-14 {3129#true} is VALID [2022-02-20 23:36:44,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {3129#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {3129#true} is VALID [2022-02-20 23:36:44,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {3129#true} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {3129#true} is VALID [2022-02-20 23:36:44,783 INFO L290 TraceCheckUtils]: 10: Hoare triple {3129#true} assume !!(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(12); {3131#(= (select |#valid| |ULTIMATE.start_main_#t~malloc7#1.base|) 1)} is VALID [2022-02-20 23:36:44,784 INFO L290 TraceCheckUtils]: 11: Hoare triple {3131#(= (select |#valid| |ULTIMATE.start_main_#t~malloc7#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1001-3 {3132#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:44,784 INFO L290 TraceCheckUtils]: 12: Hoare triple {3132#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {3132#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:44,785 INFO L290 TraceCheckUtils]: 13: Hoare triple {3132#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1001-5 {3133#(= (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|) 1)} is VALID [2022-02-20 23:36:44,785 INFO L290 TraceCheckUtils]: 14: Hoare triple {3133#(= (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {3134#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:44,785 INFO L290 TraceCheckUtils]: 15: Hoare triple {3134#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {3130#false} is VALID [2022-02-20 23:36:44,786 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:36:44,786 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:44,786 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038263018] [2022-02-20 23:36:44,786 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038263018] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:44,786 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:44,786 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:36:44,786 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479907163] [2022-02-20 23:36:44,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:44,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2022-02-20 23:36:44,787 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:44,787 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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:36:44,796 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:44,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:36:44,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:44,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:36:44,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:36:44,798 INFO L87 Difference]: Start difference. First operand 124 states and 143 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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:36:45,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:45,204 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2022-02-20 23:36:45,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:36:45,205 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2022-02-20 23:36:45,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:45,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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:36:45,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-02-20 23:36:45,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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:36:45,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 109 transitions. [2022-02-20 23:36:45,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 109 transitions. [2022-02-20 23:36:45,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:45,276 INFO L225 Difference]: With dead ends: 124 [2022-02-20 23:36:45,276 INFO L226 Difference]: Without dead ends: 124 [2022-02-20 23:36:45,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:36:45,277 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 48 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:45,277 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 241 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:36:45,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-02-20 23:36:45,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-02-20 23:36:45,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:45,279 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 123 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 122 states have internal predecessors, (142), 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:36:45,280 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 123 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 122 states have internal predecessors, (142), 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:36:45,280 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 123 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 122 states have internal predecessors, (142), 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:36:45,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:45,282 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2022-02-20 23:36:45,282 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2022-02-20 23:36:45,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:45,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:45,282 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 122 states have internal predecessors, (142), 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 124 states. [2022-02-20 23:36:45,282 INFO L87 Difference]: Start difference. First operand has 123 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 122 states have internal predecessors, (142), 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 124 states. [2022-02-20 23:36:45,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:45,284 INFO L93 Difference]: Finished difference Result 124 states and 143 transitions. [2022-02-20 23:36:45,284 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 143 transitions. [2022-02-20 23:36:45,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:45,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:45,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:45,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:45,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 94 states have (on average 1.5106382978723405) internal successors, (142), 122 states have internal predecessors, (142), 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:36:45,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 142 transitions. [2022-02-20 23:36:45,287 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 142 transitions. Word has length 16 [2022-02-20 23:36:45,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:45,287 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 142 transitions. [2022-02-20 23:36:45,287 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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:36:45,287 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 142 transitions. [2022-02-20 23:36:45,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:36:45,287 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:45,287 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:45,288 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:36:45,288 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2022-02-20 23:36:45,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:45,288 INFO L85 PathProgramCache]: Analyzing trace with hash -2003220226, now seen corresponding path program 1 times [2022-02-20 23:36:45,288 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:45,288 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511313167] [2022-02-20 23:36:45,288 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:45,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:45,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:45,352 INFO L290 TraceCheckUtils]: 0: Hoare triple {3640#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(17, 2); {3640#true} is VALID [2022-02-20 23:36:45,352 INFO L290 TraceCheckUtils]: 1: Hoare triple {3640#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~nondet6#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {3640#true} is VALID [2022-02-20 23:36:45,353 INFO L290 TraceCheckUtils]: 2: Hoare triple {3640#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {3640#true} is VALID [2022-02-20 23:36:45,353 INFO L290 TraceCheckUtils]: 3: Hoare triple {3640#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {3640#true} is VALID [2022-02-20 23:36:45,353 INFO L290 TraceCheckUtils]: 4: Hoare triple {3640#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {3640#true} is VALID [2022-02-20 23:36:45,353 INFO L290 TraceCheckUtils]: 5: Hoare triple {3640#true} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {3640#true} is VALID [2022-02-20 23:36:45,353 INFO L290 TraceCheckUtils]: 6: Hoare triple {3640#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L998-13 {3640#true} is VALID [2022-02-20 23:36:45,353 INFO L290 TraceCheckUtils]: 7: Hoare triple {3640#true} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-14 {3640#true} is VALID [2022-02-20 23:36:45,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {3640#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {3640#true} is VALID [2022-02-20 23:36:45,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {3640#true} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {3640#true} is VALID [2022-02-20 23:36:45,354 INFO L290 TraceCheckUtils]: 10: Hoare triple {3640#true} assume !!(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(12); {3642#(and (= 12 (select |#length| |ULTIMATE.start_main_#t~malloc7#1.base|)) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0))} is VALID [2022-02-20 23:36:45,354 INFO L290 TraceCheckUtils]: 11: Hoare triple {3642#(and (= 12 (select |#length| |ULTIMATE.start_main_#t~malloc7#1.base|)) (= |ULTIMATE.start_main_#t~malloc7#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1001-3 {3643#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:45,355 INFO L290 TraceCheckUtils]: 12: Hoare triple {3643#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {3643#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:45,355 INFO L290 TraceCheckUtils]: 13: Hoare triple {3643#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1001-5 {3644#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|) 12))} is VALID [2022-02-20 23:36:45,356 INFO L290 TraceCheckUtils]: 14: Hoare triple {3644#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|) 12))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem8#1.base, main_#t~mem8#1.offset;havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {3645#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) 0))} is VALID [2022-02-20 23:36:45,356 INFO L290 TraceCheckUtils]: 15: Hoare triple {3645#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) 0))} assume !(4 + main_~x~0#1.offset <= #length[main_~x~0#1.base] && 0 <= main_~x~0#1.offset); {3641#false} is VALID [2022-02-20 23:36:45,356 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:36:45,356 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:45,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511313167] [2022-02-20 23:36:45,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511313167] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:45,357 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:45,357 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:36:45,357 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188110781] [2022-02-20 23:36:45,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:45,357 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2022-02-20 23:36:45,357 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:45,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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:36:45,368 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:45,368 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:36:45,368 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:45,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:36:45,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:36:45,368 INFO L87 Difference]: Start difference. First operand 123 states and 142 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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:36:45,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:45,799 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2022-02-20 23:36:45,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:36:45,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2022-02-20 23:36:45,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:45,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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:36:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2022-02-20 23:36:45,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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:36:45,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 111 transitions. [2022-02-20 23:36:45,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 111 transitions. [2022-02-20 23:36:45,868 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:45,869 INFO L225 Difference]: With dead ends: 115 [2022-02-20 23:36:45,869 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 23:36:45,869 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=92, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:36:45,870 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 25 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:45,870 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 274 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:36:45,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 23:36:45,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 108. [2022-02-20 23:36:45,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:45,872 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 108 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 107 states have internal predecessors, (126), 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:36:45,873 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 108 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 107 states have internal predecessors, (126), 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:36:45,873 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 108 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 107 states have internal predecessors, (126), 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:36:45,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:45,875 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2022-02-20 23:36:45,875 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 134 transitions. [2022-02-20 23:36:45,875 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:45,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:45,880 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 107 states have internal predecessors, (126), 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 115 states. [2022-02-20 23:36:45,881 INFO L87 Difference]: Start difference. First operand has 108 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 107 states have internal predecessors, (126), 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 115 states. [2022-02-20 23:36:45,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:45,886 INFO L93 Difference]: Finished difference Result 115 states and 134 transitions. [2022-02-20 23:36:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 134 transitions. [2022-02-20 23:36:45,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:45,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:45,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:45,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:45,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.4157303370786516) internal successors, (126), 107 states have internal predecessors, (126), 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:36:45,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 126 transitions. [2022-02-20 23:36:45,889 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 126 transitions. Word has length 16 [2022-02-20 23:36:45,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:45,889 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 126 transitions. [2022-02-20 23:36:45,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 6 states have internal predecessors, (16), 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:36:45,890 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 126 transitions. [2022-02-20 23:36:45,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:36:45,890 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:45,890 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:45,890 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:36:45,891 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2022-02-20 23:36:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:45,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2122682636, now seen corresponding path program 1 times [2022-02-20 23:36:45,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:45,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [945745880] [2022-02-20 23:36:45,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:45,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:45,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:45,939 INFO L290 TraceCheckUtils]: 0: Hoare triple {4113#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(17, 2); {4113#true} is VALID [2022-02-20 23:36:45,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {4113#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset, main_#t~nondet2#1, main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~nondet5#1, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet9#1, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~nondet6#1, main_#t~mem13#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~short15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12);main_~head~0#1.base, main_~head~0#1.offset := main_#t~malloc1#1.base, main_#t~malloc1#1.offset;havoc main_#t~malloc1#1.base, main_#t~malloc1#1.offset; {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:45,941 INFO L290 TraceCheckUtils]: 2: Hoare triple {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:45,941 INFO L290 TraceCheckUtils]: 3: Hoare triple {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:45,942 INFO L290 TraceCheckUtils]: 4: Hoare triple {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:45,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume !(0 != main_#t~nondet5#1);havoc main_#t~nondet5#1; {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:45,942 INFO L290 TraceCheckUtils]: 6: Hoare triple {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L998-13 {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:45,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_~head~0#1.base, main_~head~0#1.offset, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-14 {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:45,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:45,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:45,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume !(0 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:45,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {4115#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {4116#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:36:45,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {4116#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {4114#false} is VALID [2022-02-20 23:36:45,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {4114#false} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {4114#false} is VALID [2022-02-20 23:36:45,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {4114#false} assume !(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {4114#false} is VALID [2022-02-20 23:36:45,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {4114#false} main_#res#1 := 0; {4114#false} is VALID [2022-02-20 23:36:45,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {4114#false} assume !(#valid == main_old_#valid#1); {4114#false} is VALID [2022-02-20 23:36:45,947 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:36:45,947 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:45,947 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [945745880] [2022-02-20 23:36:45,947 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [945745880] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:45,947 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:45,947 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:45,947 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716735340] [2022-02-20 23:36:45,947 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:45,948 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2022-02-20 23:36:45,949 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:45,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:36:45,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:45,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:36:45,959 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:45,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:36:45,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:36:45,960 INFO L87 Difference]: Start difference. First operand 108 states and 126 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:36:46,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:46,140 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2022-02-20 23:36:46,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:36:46,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 17 [2022-02-20 23:36:46,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:46,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:36:46,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-02-20 23:36:46,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:36:46,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 138 transitions. [2022-02-20 23:36:46,147 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 138 transitions. [2022-02-20 23:36:46,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:46,242 INFO L225 Difference]: With dead ends: 130 [2022-02-20 23:36:46,242 INFO L226 Difference]: Without dead ends: 130 [2022-02-20 23:36:46,242 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:36:46,244 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 112 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:46,244 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [112 Valid, 132 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:46,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-02-20 23:36:46,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 108. [2022-02-20 23:36:46,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:46,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 108 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 107 states have internal predecessors, (124), 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:36:46,248 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 108 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 107 states have internal predecessors, (124), 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:36:46,249 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 108 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 107 states have internal predecessors, (124), 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:36:46,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:46,261 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2022-02-20 23:36:46,261 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2022-02-20 23:36:46,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:46,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:46,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 107 states have internal predecessors, (124), 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 130 states. [2022-02-20 23:36:46,262 INFO L87 Difference]: Start difference. First operand has 108 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 107 states have internal predecessors, (124), 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 130 states. [2022-02-20 23:36:46,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:46,263 INFO L93 Difference]: Finished difference Result 130 states and 145 transitions. [2022-02-20 23:36:46,263 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 145 transitions. [2022-02-20 23:36:46,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:46,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:46,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:46,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:46,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 89 states have (on average 1.3932584269662922) internal successors, (124), 107 states have internal predecessors, (124), 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:36:46,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 124 transitions. [2022-02-20 23:36:46,265 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 124 transitions. Word has length 17 [2022-02-20 23:36:46,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:46,267 INFO L470 AbstractCegarLoop]: Abstraction has 108 states and 124 transitions. [2022-02-20 23:36:46,267 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:36:46,267 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 124 transitions. [2022-02-20 23:36:46,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:36:46,267 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:46,267 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:46,267 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:36:46,268 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 56 more)] === [2022-02-20 23:36:46,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:46,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1401407903, now seen corresponding path program 1 times [2022-02-20 23:36:46,268 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:46,268 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762705264] [2022-02-20 23:36:46,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:46,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:46,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:36:46,280 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:36:46,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:36:46,301 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:36:46,301 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:36:46,302 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK (59 of 60 remaining) [2022-02-20 23:36:46,308 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (58 of 60 remaining) [2022-02-20 23:36:46,308 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (57 of 60 remaining) [2022-02-20 23:36:46,308 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (56 of 60 remaining) [2022-02-20 23:36:46,310 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (55 of 60 remaining) [2022-02-20 23:36:46,310 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (54 of 60 remaining) [2022-02-20 23:36:46,310 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (53 of 60 remaining) [2022-02-20 23:36:46,310 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (52 of 60 remaining) [2022-02-20 23:36:46,310 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (51 of 60 remaining) [2022-02-20 23:36:46,311 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (50 of 60 remaining) [2022-02-20 23:36:46,311 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (49 of 60 remaining) [2022-02-20 23:36:46,311 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (48 of 60 remaining) [2022-02-20 23:36:46,311 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (47 of 60 remaining) [2022-02-20 23:36:46,311 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (46 of 60 remaining) [2022-02-20 23:36:46,311 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (45 of 60 remaining) [2022-02-20 23:36:46,311 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (44 of 60 remaining) [2022-02-20 23:36:46,311 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (43 of 60 remaining) [2022-02-20 23:36:46,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (42 of 60 remaining) [2022-02-20 23:36:46,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (41 of 60 remaining) [2022-02-20 23:36:46,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (40 of 60 remaining) [2022-02-20 23:36:46,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (39 of 60 remaining) [2022-02-20 23:36:46,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (38 of 60 remaining) [2022-02-20 23:36:46,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (37 of 60 remaining) [2022-02-20 23:36:46,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (36 of 60 remaining) [2022-02-20 23:36:46,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (35 of 60 remaining) [2022-02-20 23:36:46,312 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (34 of 60 remaining) [2022-02-20 23:36:46,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (33 of 60 remaining) [2022-02-20 23:36:46,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (32 of 60 remaining) [2022-02-20 23:36:46,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (31 of 60 remaining) [2022-02-20 23:36:46,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (30 of 60 remaining) [2022-02-20 23:36:46,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (29 of 60 remaining) [2022-02-20 23:36:46,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (28 of 60 remaining) [2022-02-20 23:36:46,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (27 of 60 remaining) [2022-02-20 23:36:46,313 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (26 of 60 remaining) [2022-02-20 23:36:46,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (25 of 60 remaining) [2022-02-20 23:36:46,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (24 of 60 remaining) [2022-02-20 23:36:46,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (23 of 60 remaining) [2022-02-20 23:36:46,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (22 of 60 remaining) [2022-02-20 23:36:46,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (21 of 60 remaining) [2022-02-20 23:36:46,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (20 of 60 remaining) [2022-02-20 23:36:46,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (19 of 60 remaining) [2022-02-20 23:36:46,314 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (18 of 60 remaining) [2022-02-20 23:36:46,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (17 of 60 remaining) [2022-02-20 23:36:46,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (16 of 60 remaining) [2022-02-20 23:36:46,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (15 of 60 remaining) [2022-02-20 23:36:46,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (14 of 60 remaining) [2022-02-20 23:36:46,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (13 of 60 remaining) [2022-02-20 23:36:46,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (12 of 60 remaining) [2022-02-20 23:36:46,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (11 of 60 remaining) [2022-02-20 23:36:46,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (10 of 60 remaining) [2022-02-20 23:36:46,315 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (9 of 60 remaining) [2022-02-20 23:36:46,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION (8 of 60 remaining) [2022-02-20 23:36:46,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (7 of 60 remaining) [2022-02-20 23:36:46,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_FREE (6 of 60 remaining) [2022-02-20 23:36:46,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE (5 of 60 remaining) [2022-02-20 23:36:46,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55ASSERT_VIOLATIONMEMORY_FREE (4 of 60 remaining) [2022-02-20 23:36:46,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56ASSERT_VIOLATIONMEMORY_FREE (3 of 60 remaining) [2022-02-20 23:36:46,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE (2 of 60 remaining) [2022-02-20 23:36:46,316 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE (1 of 60 remaining) [2022-02-20 23:36:46,317 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_LEAK (0 of 60 remaining) [2022-02-20 23:36:46,317 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:36:46,320 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:46,323 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:36:46,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 11:36:46 BoogieIcfgContainer [2022-02-20 23:36:46,352 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 23:36:46,352 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 23:36:46,352 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 23:36:46,353 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 23:36:46,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:36:41" (3/4) ... [2022-02-20 23:36:46,354 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-02-20 23:36:46,381 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 23:36:46,381 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 23:36:46,382 INFO L158 Benchmark]: Toolchain (without parser) took 5836.94ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 77.7MB in the beginning and 94.2MB in the end (delta: -16.5MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2022-02-20 23:36:46,382 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 117.4MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:36:46,383 INFO L158 Benchmark]: CACSL2BoogieTranslator took 285.61ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 82.4MB in the end (delta: -5.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:36:46,383 INFO L158 Benchmark]: Boogie Procedure Inliner took 40.11ms. Allocated memory is still 117.4MB. Free memory was 82.4MB in the beginning and 79.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:36:46,383 INFO L158 Benchmark]: Boogie Preprocessor took 33.60ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 77.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:36:46,383 INFO L158 Benchmark]: RCFGBuilder took 522.02ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 49.0MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-02-20 23:36:46,383 INFO L158 Benchmark]: TraceAbstraction took 4915.48ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 91.9MB in the beginning and 96.3MB in the end (delta: -4.4MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2022-02-20 23:36:46,384 INFO L158 Benchmark]: Witness Printer took 28.96ms. Allocated memory is still 172.0MB. Free memory was 96.3MB in the beginning and 94.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:36:46,391 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.19ms. Allocated memory is still 117.4MB. Free memory is still 95.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 285.61ms. Allocated memory is still 117.4MB. Free memory was 77.4MB in the beginning and 82.4MB in the end (delta: -5.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 40.11ms. Allocated memory is still 117.4MB. Free memory was 82.4MB in the beginning and 79.8MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.60ms. Allocated memory is still 117.4MB. Free memory was 79.8MB in the beginning and 77.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 522.02ms. Allocated memory is still 117.4MB. Free memory was 77.7MB in the beginning and 49.0MB in the end (delta: 28.8MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 4915.48ms. Allocated memory was 117.4MB in the beginning and 172.0MB in the end (delta: 54.5MB). Free memory was 91.9MB in the beginning and 96.3MB in the end (delta: -4.4MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * Witness Printer took 28.96ms. Allocated memory is still 172.0MB. Free memory was 96.3MB in the beginning and 94.2MB in the end (delta: 2.1MB). 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 - CounterExampleResult [Line: 1007]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = ((void*)0) VAL [head={-1:0}] [L998] COND FALSE !(__VERIFIER_nondet_int()) [L998] COND FALSE !(__VERIFIER_nondet_int()) [L998] head->data = 0 VAL [head={-1:0}] [L998] head->opt = head VAL [head={-1:0}] [L999] SLL* x = head; VAL [head={-1:0}, x={-1:0}] [L1001] COND FALSE !(__VERIFIER_nondet_int()) [L1004] x = head VAL [head={-1:0}, x={-1:0}] [L1005] COND TRUE x != ((void*)0) VAL [head={-1:0}, x={-1:0}] [L1007] EXPR x->data VAL [head={-1:0}, x={-1:0}, x->data=0] [L1007] EXPR x->data == 2 && x->opt == x VAL [head={-1:0}, x={-1:0}, x->data=0, x->data == 2 && x->opt == x=0] [L1007] COND TRUE !(x->data == 2 && x->opt == x) [L1007] reach_error() VAL [head={-1:0}, x={-1:0}] - UnprovableResult [Line: 997]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 997]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 998]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1001]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1007]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1008]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1017]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 993]: 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 1 procedures, 128 locations, 60 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 10, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 700 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 700 mSDsluCounter, 1569 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 907 mSDsCounter, 105 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1320 IncrementalHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 105 mSolverCounterUnsat, 662 mSDtfsCounter, 1320 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 53 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=0, InterpolantAutomatonStates: 53, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 102 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 119 NumberOfCodeBlocks, 119 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 92 ConstructedInterpolants, 0 QuantifiedInterpolants, 467 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 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 proved your program to be incorrect! [2022-02-20 23:36:46,425 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)