./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/forester-heap/dll-reverse.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:54:26,011 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:54:26,013 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:54:26,030 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:54:26,031 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:54:26,032 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:54:26,033 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:54:26,034 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:54:26,035 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:54:26,036 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:54:26,036 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:54:26,037 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:54:26,038 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:54:26,038 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:54:26,039 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:54:26,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:54:26,040 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:54:26,041 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:54:26,042 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:54:26,043 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:54:26,044 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:54:26,045 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:54:26,046 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:54:26,046 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:54:26,048 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:54:26,048 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:54:26,048 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:54:26,049 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:54:26,049 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:54:26,050 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:54:26,050 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:54:26,051 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:54:26,051 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:54:26,052 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:54:26,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:54:26,052 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:54:26,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:54:26,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:54:26,053 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:54:26,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:54:26,054 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:54:26,055 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:54:26,068 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:54:26,068 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:54:26,068 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:54:26,069 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:54:26,069 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:54:26,069 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:54:26,070 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:54:26,070 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:54:26,070 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:54:26,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:54:26,071 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:54:26,071 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:54:26,071 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:54:26,071 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:54:26,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:54:26,072 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:54:26,072 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:54:26,072 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:54:26,072 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:54:26,072 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:54:26,072 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:54:26,073 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:54:26,073 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:54:26,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:54:26,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:54:26,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:54:26,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:54:26,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:54:26,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:54:26,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:54:26,074 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 [2022-02-20 23:54:26,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:54:26,247 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:54:26,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:54:26,249 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:54:26,250 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:54:26,251 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-reverse.i [2022-02-20 23:54:26,317 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa3a97b4/2029751884514176bef00fbd6e6508c2/FLAG1a1fc7e34 [2022-02-20 23:54:26,687 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:54:26,688 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i [2022-02-20 23:54:26,694 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa3a97b4/2029751884514176bef00fbd6e6508c2/FLAG1a1fc7e34 [2022-02-20 23:54:26,704 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1aa3a97b4/2029751884514176bef00fbd6e6508c2 [2022-02-20 23:54:26,705 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:54:26,706 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:54:26,707 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:54:26,707 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:54:26,709 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:54:26,710 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:54:26" (1/1) ... [2022-02-20 23:54:26,711 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ffcb9d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:26, skipping insertion in model container [2022-02-20 23:54:26,711 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:54:26" (1/1) ... [2022-02-20 23:54:26,715 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:54:26,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:54:26,947 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/dll-reverse.i[22309,22322] [2022-02-20 23:54:26,949 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/dll-reverse.i[22394,22407] [2022-02-20 23:54:26,953 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/dll-reverse.i[22924,22937] [2022-02-20 23:54:26,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:54:26,961 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:54:26,992 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/dll-reverse.i[22309,22322] [2022-02-20 23:54:26,997 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/dll-reverse.i[22394,22407] [2022-02-20 23:54:27,000 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/dll-reverse.i[22924,22937] [2022-02-20 23:54:27,002 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:54:27,019 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:54:27,020 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:27 WrapperNode [2022-02-20 23:54:27,020 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:54:27,021 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:54:27,021 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:54:27,021 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:54:27,028 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:54:27" (1/1) ... [2022-02-20 23:54:27,041 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:54:27" (1/1) ... [2022-02-20 23:54:27,065 INFO L137 Inliner]: procedures = 119, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 147 [2022-02-20 23:54:27,065 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:54:27,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:54:27,066 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:54:27,066 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:54:27,071 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:27" (1/1) ... [2022-02-20 23:54:27,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:27" (1/1) ... [2022-02-20 23:54:27,077 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:27" (1/1) ... [2022-02-20 23:54:27,077 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:27" (1/1) ... [2022-02-20 23:54:27,085 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:27" (1/1) ... [2022-02-20 23:54:27,089 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:27" (1/1) ... [2022-02-20 23:54:27,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:27" (1/1) ... [2022-02-20 23:54:27,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:54:27,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:54:27,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:54:27,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:54:27,094 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:27" (1/1) ... [2022-02-20 23:54:27,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:54:27,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:54:27,128 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:54:27,136 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:54:27,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:54:27,157 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:54:27,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:54:27,157 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:54:27,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:54:27,158 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:54:27,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:54:27,158 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:54:27,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:54:27,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:54:27,250 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:54:27,253 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:54:27,710 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:54:27,718 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:54:27,719 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-02-20 23:54:27,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:54:27 BoogieIcfgContainer [2022-02-20 23:54:27,721 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:54:27,723 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:54:27,723 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:54:27,726 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:54:27,727 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:54:26" (1/3) ... [2022-02-20 23:54:27,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f7aa2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:54:27, skipping insertion in model container [2022-02-20 23:54:27,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:54:27" (2/3) ... [2022-02-20 23:54:27,728 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28f7aa2f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:54:27, skipping insertion in model container [2022-02-20 23:54:27,728 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:54:27" (3/3) ... [2022-02-20 23:54:27,729 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2022-02-20 23:54:27,733 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:54:27,733 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 69 error locations. [2022-02-20 23:54:27,766 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:54:27,771 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:54:27,772 INFO L340 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2022-02-20 23:54:27,786 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 79 states have (on average 2.1645569620253164) internal successors, (171), 148 states have internal predecessors, (171), 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:54:27,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:54:27,792 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:27,793 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:54:27,793 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:54:27,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:27,796 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:54:27,803 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:27,803 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826148879] [2022-02-20 23:54:27,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:27,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:27,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:27,929 INFO L290 TraceCheckUtils]: 0: Hoare triple {152#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {152#true} is VALID [2022-02-20 23:54:27,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {154#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:27,932 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} assume !(1 == #valid[main_~head~0#1.base]); {153#false} is VALID [2022-02-20 23:54:27,932 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:54:27,933 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:27,933 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826148879] [2022-02-20 23:54:27,933 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826148879] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:27,934 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:27,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:54:27,935 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819289605] [2022-02-20 23:54:27,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:27,939 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:54:27,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:27,942 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:54:27,947 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:54:27,947 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:54:27,948 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:27,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:54:27,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:27,970 INFO L87 Difference]: Start difference. First operand has 149 states, 79 states have (on average 2.1645569620253164) internal successors, (171), 148 states have internal predecessors, (171), 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:54:28,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:28,209 INFO L93 Difference]: Finished difference Result 146 states and 154 transitions. [2022-02-20 23:54:28,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:54:28,210 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:54:28,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:28,211 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:54:28,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2022-02-20 23:54:28,218 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:54:28,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2022-02-20 23:54:28,222 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2022-02-20 23:54:28,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:28,335 INFO L225 Difference]: With dead ends: 146 [2022-02-20 23:54:28,335 INFO L226 Difference]: Without dead ends: 144 [2022-02-20 23:54:28,336 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:54:28,338 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 100 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:28,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 128 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:28,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-02-20 23:54:28,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2022-02-20 23:54:28,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:28,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 144 states, 78 states have (on average 1.9487179487179487) internal successors, (152), 143 states have internal predecessors, (152), 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:54:28,362 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 144 states, 78 states have (on average 1.9487179487179487) internal successors, (152), 143 states have internal predecessors, (152), 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:54:28,362 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 144 states, 78 states have (on average 1.9487179487179487) internal successors, (152), 143 states have internal predecessors, (152), 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:54:28,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:28,367 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2022-02-20 23:54:28,367 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2022-02-20 23:54:28,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:28,368 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:28,368 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 78 states have (on average 1.9487179487179487) internal successors, (152), 143 states have internal predecessors, (152), 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 144 states. [2022-02-20 23:54:28,368 INFO L87 Difference]: Start difference. First operand has 144 states, 78 states have (on average 1.9487179487179487) internal successors, (152), 143 states have internal predecessors, (152), 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 144 states. [2022-02-20 23:54:28,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:28,372 INFO L93 Difference]: Finished difference Result 144 states and 152 transitions. [2022-02-20 23:54:28,372 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2022-02-20 23:54:28,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:28,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:28,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:28,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:28,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 78 states have (on average 1.9487179487179487) internal successors, (152), 143 states have internal predecessors, (152), 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:54:28,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 152 transitions. [2022-02-20 23:54:28,392 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 152 transitions. Word has length 3 [2022-02-20 23:54:28,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:28,392 INFO L470 AbstractCegarLoop]: Abstraction has 144 states and 152 transitions. [2022-02-20 23:54:28,392 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:54:28,392 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 152 transitions. [2022-02-20 23:54:28,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:54:28,392 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:28,393 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:54:28,393 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:54:28,393 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:54:28,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:28,393 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:54:28,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:28,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196701817] [2022-02-20 23:54:28,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:28,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:28,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:28,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {735#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {735#true} is VALID [2022-02-20 23:54:28,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {735#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {737#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (- 12)) 0))} is VALID [2022-02-20 23:54:28,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {737#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (- 12)) 0))} assume !(4 + main_~head~0#1.offset <= #length[main_~head~0#1.base] && 0 <= main_~head~0#1.offset); {736#false} is VALID [2022-02-20 23:54:28,427 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:54:28,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:28,428 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196701817] [2022-02-20 23:54:28,428 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196701817] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:28,428 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:28,428 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:54:28,428 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227404241] [2022-02-20 23:54:28,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:28,429 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:54:28,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:28,429 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:54:28,436 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:54:28,436 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:54:28,436 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:28,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:54:28,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:54:28,437 INFO L87 Difference]: Start difference. First operand 144 states and 152 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:54:28,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:28,675 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2022-02-20 23:54:28,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:54:28,675 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:54:28,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:28,675 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:54:28,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2022-02-20 23:54:28,684 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:54:28,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2022-02-20 23:54:28,687 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 152 transitions. [2022-02-20 23:54:28,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:28,801 INFO L225 Difference]: With dead ends: 141 [2022-02-20 23:54:28,802 INFO L226 Difference]: Without dead ends: 141 [2022-02-20 23:54:28,804 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:54:28,805 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 97 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:28,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 124 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:28,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-02-20 23:54:28,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-02-20 23:54:28,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:28,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 141 states, 78 states have (on average 1.9102564102564104) internal successors, (149), 140 states have internal predecessors, (149), 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:54:28,816 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 141 states, 78 states have (on average 1.9102564102564104) internal successors, (149), 140 states have internal predecessors, (149), 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:54:28,816 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 141 states, 78 states have (on average 1.9102564102564104) internal successors, (149), 140 states have internal predecessors, (149), 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:54:28,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:28,819 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2022-02-20 23:54:28,820 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2022-02-20 23:54:28,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:28,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:28,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 78 states have (on average 1.9102564102564104) internal successors, (149), 140 states have internal predecessors, (149), 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:54:28,821 INFO L87 Difference]: Start difference. First operand has 141 states, 78 states have (on average 1.9102564102564104) internal successors, (149), 140 states have internal predecessors, (149), 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:54:28,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:28,826 INFO L93 Difference]: Finished difference Result 141 states and 149 transitions. [2022-02-20 23:54:28,826 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2022-02-20 23:54:28,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:28,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:28,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:28,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:28,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 78 states have (on average 1.9102564102564104) internal successors, (149), 140 states have internal predecessors, (149), 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:54:28,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 149 transitions. [2022-02-20 23:54:28,838 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 149 transitions. Word has length 3 [2022-02-20 23:54:28,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:28,838 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 149 transitions. [2022-02-20 23:54:28,838 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:54:28,839 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 149 transitions. [2022-02-20 23:54:28,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:54:28,839 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:28,839 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:28,840 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:54:28,840 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:54:28,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:28,840 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2022-02-20 23:54:28,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:28,842 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792233089] [2022-02-20 23:54:28,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:28,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:28,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:28,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {1304#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {1304#true} is VALID [2022-02-20 23:54:28,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {1304#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {1306#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:28,954 INFO L290 TraceCheckUtils]: 2: Hoare triple {1306#(= (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 {1306#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:28,955 INFO L290 TraceCheckUtils]: 3: Hoare triple {1306#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {1306#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:28,955 INFO L290 TraceCheckUtils]: 4: Hoare triple {1306#(= (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 {1306#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:28,955 INFO L290 TraceCheckUtils]: 5: Hoare triple {1306#(= (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; {1307#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:28,956 INFO L290 TraceCheckUtils]: 6: Hoare triple {1307#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1307#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:28,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {1307#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {1307#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:28,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {1307#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {1305#false} is VALID [2022-02-20 23:54:28,957 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:54:28,957 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:28,958 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792233089] [2022-02-20 23:54:28,958 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792233089] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:28,958 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:28,958 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:54:28,958 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300570807] [2022-02-20 23:54:28,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:28,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-02-20 23:54:28,959 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:28,959 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:54:28,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:28,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:54:28,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:28,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:54:28,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:54:28,967 INFO L87 Difference]: Start difference. First operand 141 states and 149 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:54:29,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:29,210 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2022-02-20 23:54:29,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:54:29,211 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-02-20 23:54:29,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:29,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:54:29,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2022-02-20 23:54:29,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:54:29,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 161 transitions. [2022-02-20 23:54:29,214 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 161 transitions. [2022-02-20 23:54:29,316 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:29,318 INFO L225 Difference]: With dead ends: 132 [2022-02-20 23:54:29,318 INFO L226 Difference]: Without dead ends: 132 [2022-02-20 23:54:29,318 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:54:29,319 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 168 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:29,319 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 90 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:29,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-20 23:54:29,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 128. [2022-02-20 23:54:29,322 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:29,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 128 states, 82 states have (on average 1.7073170731707317) internal successors, (140), 127 states have internal predecessors, (140), 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:54:29,322 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 128 states, 82 states have (on average 1.7073170731707317) internal successors, (140), 127 states have internal predecessors, (140), 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:54:29,323 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 128 states, 82 states have (on average 1.7073170731707317) internal successors, (140), 127 states have internal predecessors, (140), 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:54:29,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:29,325 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2022-02-20 23:54:29,325 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2022-02-20 23:54:29,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:29,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:29,326 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 82 states have (on average 1.7073170731707317) internal successors, (140), 127 states have internal predecessors, (140), 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 132 states. [2022-02-20 23:54:29,326 INFO L87 Difference]: Start difference. First operand has 128 states, 82 states have (on average 1.7073170731707317) internal successors, (140), 127 states have internal predecessors, (140), 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 132 states. [2022-02-20 23:54:29,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:29,329 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2022-02-20 23:54:29,329 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2022-02-20 23:54:29,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:29,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:29,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:29,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:29,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 82 states have (on average 1.7073170731707317) internal successors, (140), 127 states have internal predecessors, (140), 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:54:29,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 140 transitions. [2022-02-20 23:54:29,331 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 140 transitions. Word has length 9 [2022-02-20 23:54:29,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:29,332 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 140 transitions. [2022-02-20 23:54:29,332 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:54:29,332 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 140 transitions. [2022-02-20 23:54:29,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:54:29,332 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:29,332 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:29,332 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:54:29,332 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:54:29,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:29,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2022-02-20 23:54:29,333 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:29,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352860682] [2022-02-20 23:54:29,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:29,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:29,393 INFO L290 TraceCheckUtils]: 0: Hoare triple {1836#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {1836#true} is VALID [2022-02-20 23:54:29,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {1836#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {1838#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:54:29,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {1838#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |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 {1838#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:54:29,395 INFO L290 TraceCheckUtils]: 3: Hoare triple {1838#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {1838#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:54:29,396 INFO L290 TraceCheckUtils]: 4: Hoare triple {1838#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L998 {1838#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:54:29,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {1838#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) 12) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {1839#(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:54:29,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {1839#(and (= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1839#(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:54:29,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {1839#(and (= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {1839#(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:54:29,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {1839#(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); {1837#false} is VALID [2022-02-20 23:54:29,398 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:54:29,398 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:29,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352860682] [2022-02-20 23:54:29,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352860682] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:29,398 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:29,398 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:54:29,398 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898821145] [2022-02-20 23:54:29,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:29,399 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-02-20 23:54:29,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:29,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:54:29,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:29,405 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:54:29,405 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:29,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:54:29,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:54:29,406 INFO L87 Difference]: Start difference. First operand 128 states and 140 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:54:29,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:29,790 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2022-02-20 23:54:29,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:54:29,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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 9 [2022-02-20 23:54:29,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:54:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-02-20 23:54:29,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:54:29,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 202 transitions. [2022-02-20 23:54:29,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 202 transitions. [2022-02-20 23:54:29,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:29,931 INFO L225 Difference]: With dead ends: 176 [2022-02-20 23:54:29,931 INFO L226 Difference]: Without dead ends: 176 [2022-02-20 23:54:29,931 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:54:29,932 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 176 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:29,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 137 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:29,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2022-02-20 23:54:29,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 157. [2022-02-20 23:54:29,936 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:29,936 INFO L82 GeneralOperation]: Start isEquivalent. First operand 176 states. Second operand has 157 states, 111 states have (on average 1.5945945945945945) internal successors, (177), 156 states have internal predecessors, (177), 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:54:29,936 INFO L74 IsIncluded]: Start isIncluded. First operand 176 states. Second operand has 157 states, 111 states have (on average 1.5945945945945945) internal successors, (177), 156 states have internal predecessors, (177), 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:54:29,937 INFO L87 Difference]: Start difference. First operand 176 states. Second operand has 157 states, 111 states have (on average 1.5945945945945945) internal successors, (177), 156 states have internal predecessors, (177), 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:54:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:29,939 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2022-02-20 23:54:29,939 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 190 transitions. [2022-02-20 23:54:29,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:29,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:29,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 111 states have (on average 1.5945945945945945) internal successors, (177), 156 states have internal predecessors, (177), 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 176 states. [2022-02-20 23:54:29,940 INFO L87 Difference]: Start difference. First operand has 157 states, 111 states have (on average 1.5945945945945945) internal successors, (177), 156 states have internal predecessors, (177), 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 176 states. [2022-02-20 23:54:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:29,946 INFO L93 Difference]: Finished difference Result 176 states and 190 transitions. [2022-02-20 23:54:29,946 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 190 transitions. [2022-02-20 23:54:29,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:29,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:29,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:29,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:29,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 111 states have (on average 1.5945945945945945) internal successors, (177), 156 states have internal predecessors, (177), 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:54:29,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 177 transitions. [2022-02-20 23:54:29,949 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 177 transitions. Word has length 9 [2022-02-20 23:54:29,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:29,950 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 177 transitions. [2022-02-20 23:54:29,950 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 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:54:29,950 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 177 transitions. [2022-02-20 23:54:29,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:54:29,950 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:29,950 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:29,950 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:54:29,950 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:54:29,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:29,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-02-20 23:54:29,951 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:29,951 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1854341821] [2022-02-20 23:54:29,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:29,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:29,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:30,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {2529#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {2529#true} is VALID [2022-02-20 23:54:30,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {2529#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {2529#true} is VALID [2022-02-20 23:54:30,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {2529#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {2529#true} is VALID [2022-02-20 23:54:30,017 INFO L290 TraceCheckUtils]: 3: Hoare triple {2529#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {2529#true} is VALID [2022-02-20 23:54:30,017 INFO L290 TraceCheckUtils]: 4: Hoare triple {2529#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L998 {2529#true} is VALID [2022-02-20 23:54:30,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {2529#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {2529#true} is VALID [2022-02-20 23:54:30,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {2529#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {2529#true} is VALID [2022-02-20 23:54:30,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {2529#true} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {2531#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 12))} is VALID [2022-02-20 23:54:30,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {2531#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 12))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-3 {2532#(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:54:30,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {2532#(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~malloc3#1.base, main_#t~malloc3#1.offset; {2532#(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:54:30,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {2532#(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~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-5 {2533#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)) 0))} is VALID [2022-02-20 23:54:30,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {2533#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)) 0))} assume !(4 + (4 + main_#t~mem4#1.offset) <= #length[main_#t~mem4#1.base] && 0 <= 4 + main_#t~mem4#1.offset); {2530#false} is VALID [2022-02-20 23:54:30,020 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:54:30,020 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:30,020 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1854341821] [2022-02-20 23:54:30,021 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1854341821] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:30,021 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:30,021 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:54:30,021 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871517102] [2022-02-20 23:54:30,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:30,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:54:30,021 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:30,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:54:30,029 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:54:30,029 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:54:30,029 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:30,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:54:30,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:30,030 INFO L87 Difference]: Start difference. First operand 157 states and 177 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:54:30,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:30,409 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2022-02-20 23:54:30,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:54:30,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:54:30,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:30,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:54:30,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2022-02-20 23:54:30,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:54:30,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 132 transitions. [2022-02-20 23:54:30,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 132 transitions. [2022-02-20 23:54:30,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:30,486 INFO L225 Difference]: With dead ends: 156 [2022-02-20 23:54:30,486 INFO L226 Difference]: Without dead ends: 156 [2022-02-20 23:54:30,486 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:54:30,487 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 6 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:30,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 297 Invalid, 217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:30,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-02-20 23:54:30,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-02-20 23:54:30,492 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:30,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 156 states, 111 states have (on average 1.5765765765765767) internal successors, (175), 155 states have internal predecessors, (175), 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:54:30,493 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 156 states, 111 states have (on average 1.5765765765765767) internal successors, (175), 155 states have internal predecessors, (175), 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:54:30,493 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 156 states, 111 states have (on average 1.5765765765765767) internal successors, (175), 155 states have internal predecessors, (175), 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:54:30,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:30,495 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2022-02-20 23:54:30,495 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2022-02-20 23:54:30,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:30,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:30,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 111 states have (on average 1.5765765765765767) internal successors, (175), 155 states have internal predecessors, (175), 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 156 states. [2022-02-20 23:54:30,496 INFO L87 Difference]: Start difference. First operand has 156 states, 111 states have (on average 1.5765765765765767) internal successors, (175), 155 states have internal predecessors, (175), 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 156 states. [2022-02-20 23:54:30,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:30,498 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2022-02-20 23:54:30,498 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2022-02-20 23:54:30,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:30,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:30,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:30,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:30,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 111 states have (on average 1.5765765765765767) internal successors, (175), 155 states have internal predecessors, (175), 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:54:30,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2022-02-20 23:54:30,501 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 12 [2022-02-20 23:54:30,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:30,501 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2022-02-20 23:54:30,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:54:30,501 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2022-02-20 23:54:30,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:54:30,501 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:30,502 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:30,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:54:30,502 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:54:30,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:30,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-02-20 23:54:30,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:30,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654891026] [2022-02-20 23:54:30,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:30,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:30,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:30,563 INFO L290 TraceCheckUtils]: 0: Hoare triple {3164#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {3164#true} is VALID [2022-02-20 23:54:30,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {3164#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {3164#true} is VALID [2022-02-20 23:54:30,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {3164#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {3164#true} is VALID [2022-02-20 23:54:30,564 INFO L290 TraceCheckUtils]: 3: Hoare triple {3164#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {3164#true} is VALID [2022-02-20 23:54:30,564 INFO L290 TraceCheckUtils]: 4: Hoare triple {3164#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L998 {3164#true} is VALID [2022-02-20 23:54:30,564 INFO L290 TraceCheckUtils]: 5: Hoare triple {3164#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {3164#true} is VALID [2022-02-20 23:54:30,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {3164#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {3164#true} is VALID [2022-02-20 23:54:30,565 INFO L290 TraceCheckUtils]: 7: Hoare triple {3164#true} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {3166#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} is VALID [2022-02-20 23:54:30,565 INFO L290 TraceCheckUtils]: 8: Hoare triple {3166#(= (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_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-3 {3167#(= (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:54:30,566 INFO L290 TraceCheckUtils]: 9: Hoare triple {3167#(= (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~malloc3#1.base, main_#t~malloc3#1.offset; {3167#(= (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:54:30,566 INFO L290 TraceCheckUtils]: 10: Hoare triple {3167#(= (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~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-5 {3168#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} is VALID [2022-02-20 23:54:30,567 INFO L290 TraceCheckUtils]: 11: Hoare triple {3168#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} assume !(1 == #valid[main_#t~mem4#1.base]); {3165#false} is VALID [2022-02-20 23:54:30,567 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:54:30,568 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:30,568 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654891026] [2022-02-20 23:54:30,568 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654891026] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:30,568 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:30,568 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:54:30,569 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453387541] [2022-02-20 23:54:30,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:30,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:54:30,569 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:30,570 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:54:30,577 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:54:30,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:54:30,577 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:30,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:54:30,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:30,580 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:54:30,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:30,910 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2022-02-20 23:54:30,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:54:30,910 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:54:30,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:30,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:54:30,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2022-02-20 23:54:30,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:54:30,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 131 transitions. [2022-02-20 23:54:30,913 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 131 transitions. [2022-02-20 23:54:31,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:31,008 INFO L225 Difference]: With dead ends: 155 [2022-02-20 23:54:31,008 INFO L226 Difference]: Without dead ends: 155 [2022-02-20 23:54:31,008 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:54:31,008 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 7 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:31,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 315 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:31,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-02-20 23:54:31,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2022-02-20 23:54:31,012 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:31,012 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 155 states, 111 states have (on average 1.5585585585585586) internal successors, (173), 154 states have internal predecessors, (173), 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:54:31,012 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 155 states, 111 states have (on average 1.5585585585585586) internal successors, (173), 154 states have internal predecessors, (173), 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:54:31,012 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 155 states, 111 states have (on average 1.5585585585585586) internal successors, (173), 154 states have internal predecessors, (173), 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:54:31,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:31,014 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2022-02-20 23:54:31,014 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2022-02-20 23:54:31,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:31,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:31,015 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 111 states have (on average 1.5585585585585586) internal successors, (173), 154 states have internal predecessors, (173), 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 155 states. [2022-02-20 23:54:31,015 INFO L87 Difference]: Start difference. First operand has 155 states, 111 states have (on average 1.5585585585585586) internal successors, (173), 154 states have internal predecessors, (173), 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 155 states. [2022-02-20 23:54:31,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:31,017 INFO L93 Difference]: Finished difference Result 155 states and 173 transitions. [2022-02-20 23:54:31,017 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2022-02-20 23:54:31,018 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:31,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:31,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:31,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:31,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 111 states have (on average 1.5585585585585586) internal successors, (173), 154 states have internal predecessors, (173), 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:54:31,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 173 transitions. [2022-02-20 23:54:31,020 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 173 transitions. Word has length 12 [2022-02-20 23:54:31,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:31,020 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 173 transitions. [2022-02-20 23:54:31,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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:54:31,021 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 173 transitions. [2022-02-20 23:54:31,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:54:31,021 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:31,021 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:31,021 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:54:31,021 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:54:31,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:31,021 INFO L85 PathProgramCache]: Analyzing trace with hash 1455563597, now seen corresponding path program 1 times [2022-02-20 23:54:31,021 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:31,022 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966134567] [2022-02-20 23:54:31,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:31,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:31,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {3795#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {3795#true} is VALID [2022-02-20 23:54:31,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {3795#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {3797#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:54:31,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {3797#(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 {3797#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:54:31,055 INFO L290 TraceCheckUtils]: 3: Hoare triple {3797#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {3797#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:54:31,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {3797#(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 {3797#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:54:31,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {3797#(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; {3797#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:54:31,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {3797#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {3797#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:54:31,056 INFO L290 TraceCheckUtils]: 7: Hoare triple {3797#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {3797#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:54:31,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {3797#(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; {3798#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:54:31,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {3798#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008-6 {3798#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:54:31,058 INFO L290 TraceCheckUtils]: 10: Hoare triple {3798#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {3798#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:54:31,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {3798#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume main_#t~short8#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~short8#1 := 0 != main_#t~nondet7#1; {3798#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:54:31,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {3798#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1;havoc main_#t~short8#1; {3798#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:54:31,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {3798#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {3796#false} is VALID [2022-02-20 23:54:31,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {3796#false} assume !false; {3796#false} is VALID [2022-02-20 23:54:31,059 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:54:31,059 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:31,059 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966134567] [2022-02-20 23:54:31,059 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966134567] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:31,059 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:31,059 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:54:31,059 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71497983] [2022-02-20 23:54:31,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:31,060 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-02-20 23:54:31,060 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:31,060 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:54:31,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:31,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:54:31,069 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:31,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:54:31,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:54:31,069 INFO L87 Difference]: Start difference. First operand 155 states and 173 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:54:31,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:31,319 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2022-02-20 23:54:31,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:54:31,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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 15 [2022-02-20 23:54:31,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:31,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:54:31,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-02-20 23:54:31,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:54:31,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 181 transitions. [2022-02-20 23:54:31,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 181 transitions. [2022-02-20 23:54:31,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:31,431 INFO L225 Difference]: With dead ends: 167 [2022-02-20 23:54:31,431 INFO L226 Difference]: Without dead ends: 167 [2022-02-20 23:54:31,431 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:54:31,432 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 158 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:31,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 190 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:31,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-02-20 23:54:31,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 155. [2022-02-20 23:54:31,434 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:31,435 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 155 states, 111 states have (on average 1.5315315315315314) internal successors, (170), 154 states have internal predecessors, (170), 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:54:31,435 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 155 states, 111 states have (on average 1.5315315315315314) internal successors, (170), 154 states have internal predecessors, (170), 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:54:31,435 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 155 states, 111 states have (on average 1.5315315315315314) internal successors, (170), 154 states have internal predecessors, (170), 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:54:31,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:31,437 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2022-02-20 23:54:31,438 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2022-02-20 23:54:31,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:31,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:31,438 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 111 states have (on average 1.5315315315315314) internal successors, (170), 154 states have internal predecessors, (170), 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 167 states. [2022-02-20 23:54:31,438 INFO L87 Difference]: Start difference. First operand has 155 states, 111 states have (on average 1.5315315315315314) internal successors, (170), 154 states have internal predecessors, (170), 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 167 states. [2022-02-20 23:54:31,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:31,441 INFO L93 Difference]: Finished difference Result 167 states and 180 transitions. [2022-02-20 23:54:31,441 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 180 transitions. [2022-02-20 23:54:31,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:31,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:31,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:31,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:31,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 111 states have (on average 1.5315315315315314) internal successors, (170), 154 states have internal predecessors, (170), 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:54:31,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 170 transitions. [2022-02-20 23:54:31,443 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 170 transitions. Word has length 15 [2022-02-20 23:54:31,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:31,443 INFO L470 AbstractCegarLoop]: Abstraction has 155 states and 170 transitions. [2022-02-20 23:54:31,444 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 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:54:31,444 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 170 transitions. [2022-02-20 23:54:31,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:54:31,444 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:31,444 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:54:31,444 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:54:31,444 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:54:31,444 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:31,444 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-02-20 23:54:31,445 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:31,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300075795] [2022-02-20 23:54:31,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:31,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:31,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {4459#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {4459#true} is VALID [2022-02-20 23:54:31,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {4459#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {4459#true} is VALID [2022-02-20 23:54:31,524 INFO L290 TraceCheckUtils]: 2: Hoare triple {4459#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {4461#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:31,525 INFO L290 TraceCheckUtils]: 3: Hoare triple {4461#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {4461#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:31,525 INFO L290 TraceCheckUtils]: 4: Hoare triple {4461#(= (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 {4461#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:31,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {4461#(= (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; {4462#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:31,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {4462#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {4462#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:31,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {4462#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {4463#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)))} is VALID [2022-02-20 23:54:31,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {4463#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-3 {4464#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:31,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {4464#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~malloc3#1.base, main_#t~malloc3#1.offset; {4464#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:31,528 INFO L290 TraceCheckUtils]: 10: Hoare triple {4464#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-5 {4465#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (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:54:31,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {4465#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (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 write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4); srcloc: L1004-6 {4466#(= (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:54:31,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {4466#(= (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~mem4#1.base, main_#t~mem4#1.offset; {4466#(= (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:54:31,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {4466#(= (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~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-8 {4467#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} is VALID [2022-02-20 23:54:31,544 INFO L290 TraceCheckUtils]: 14: Hoare triple {4467#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {4462#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:31,544 INFO L290 TraceCheckUtils]: 15: Hoare triple {4462#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {4460#false} is VALID [2022-02-20 23:54:31,545 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:54:31,545 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:31,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300075795] [2022-02-20 23:54:31,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300075795] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:31,545 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:31,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:54:31,545 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605792595] [2022-02-20 23:54:31,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:31,546 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:54:31,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:31,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:54:31,556 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:54:31,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:54:31,556 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:31,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:54:31,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:54:31,557 INFO L87 Difference]: Start difference. First operand 155 states and 170 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:54:32,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:32,173 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2022-02-20 23:54:32,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:54:32,174 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:54:32,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:32,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:54:32,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2022-02-20 23:54:32,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:54:32,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 135 transitions. [2022-02-20 23:54:32,176 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 135 transitions. [2022-02-20 23:54:32,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:32,267 INFO L225 Difference]: With dead ends: 155 [2022-02-20 23:54:32,267 INFO L226 Difference]: Without dead ends: 155 [2022-02-20 23:54:32,267 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:54:32,268 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 168 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:32,268 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 213 Invalid, 404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:54:32,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-02-20 23:54:32,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2022-02-20 23:54:32,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:32,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 154 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 153 states have internal predecessors, (169), 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:54:32,270 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 154 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 153 states have internal predecessors, (169), 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:54:32,271 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 154 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 153 states have internal predecessors, (169), 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:54:32,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:32,273 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2022-02-20 23:54:32,273 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2022-02-20 23:54:32,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:32,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:32,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 153 states have internal predecessors, (169), 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 155 states. [2022-02-20 23:54:32,274 INFO L87 Difference]: Start difference. First operand has 154 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 153 states have internal predecessors, (169), 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 155 states. [2022-02-20 23:54:32,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:32,276 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2022-02-20 23:54:32,276 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 169 transitions. [2022-02-20 23:54:32,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:32,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:32,276 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:32,276 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 111 states have (on average 1.5225225225225225) internal successors, (169), 153 states have internal predecessors, (169), 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:54:32,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 169 transitions. [2022-02-20 23:54:32,284 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 169 transitions. Word has length 16 [2022-02-20 23:54:32,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:32,284 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 169 transitions. [2022-02-20 23:54:32,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 9 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:54:32,284 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 169 transitions. [2022-02-20 23:54:32,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:54:32,285 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:32,285 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:54:32,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:54:32,285 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:54:32,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:32,285 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-02-20 23:54:32,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:32,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2069873586] [2022-02-20 23:54:32,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:32,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:32,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:32,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {5101#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {5101#true} is VALID [2022-02-20 23:54:32,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {5101#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {5101#true} is VALID [2022-02-20 23:54:32,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {5101#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {5103#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:32,405 INFO L290 TraceCheckUtils]: 3: Hoare triple {5103#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {5103#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:32,406 INFO L290 TraceCheckUtils]: 4: Hoare triple {5103#(= (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 {5103#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:32,406 INFO L290 TraceCheckUtils]: 5: Hoare triple {5103#(= (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; {5104#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:32,406 INFO L290 TraceCheckUtils]: 6: Hoare triple {5104#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {5104#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:32,407 INFO L290 TraceCheckUtils]: 7: Hoare triple {5104#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {5105#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 12))} is VALID [2022-02-20 23:54:32,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {5105#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 12))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-3 {5106#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:32,408 INFO L290 TraceCheckUtils]: 9: Hoare triple {5106#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {5106#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:32,409 INFO L290 TraceCheckUtils]: 10: Hoare triple {5106#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-5 {5107#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (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:54:32,409 INFO L290 TraceCheckUtils]: 11: Hoare triple {5107#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (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 write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4); srcloc: L1004-6 {5108#(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:54:32,410 INFO L290 TraceCheckUtils]: 12: Hoare triple {5108#(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~mem4#1.base, main_#t~mem4#1.offset; {5108#(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:54:32,410 INFO L290 TraceCheckUtils]: 13: Hoare triple {5108#(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~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-8 {5109#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) 12))} is VALID [2022-02-20 23:54:32,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {5109#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) 12))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {5110#(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:54:32,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {5110#(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); {5102#false} is VALID [2022-02-20 23:54:32,411 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:54:32,411 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:32,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2069873586] [2022-02-20 23:54:32,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2069873586] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:32,412 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:32,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:54:32,412 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986203682] [2022-02-20 23:54:32,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:32,412 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:54:32,412 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:32,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:54:32,424 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:54:32,424 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:54:32,424 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:32,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:54:32,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:54:32,425 INFO L87 Difference]: Start difference. First operand 154 states and 169 transitions. Second operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:54:33,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:33,535 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2022-02-20 23:54:33,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:54:33,535 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:54:33,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:33,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:54:33,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 145 transitions. [2022-02-20 23:54:33,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:54:33,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 145 transitions. [2022-02-20 23:54:33,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 145 transitions. [2022-02-20 23:54:33,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:33,647 INFO L225 Difference]: With dead ends: 152 [2022-02-20 23:54:33,647 INFO L226 Difference]: Without dead ends: 152 [2022-02-20 23:54:33,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=140, Invalid=366, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:54:33,647 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 159 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:33,648 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [159 Valid, 333 Invalid, 681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:54:33,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-02-20 23:54:33,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 141. [2022-02-20 23:54:33,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:33,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 141 states, 103 states have (on average 1.5048543689320388) internal successors, (155), 140 states have internal predecessors, (155), 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:54:33,650 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 141 states, 103 states have (on average 1.5048543689320388) internal successors, (155), 140 states have internal predecessors, (155), 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:54:33,650 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 141 states, 103 states have (on average 1.5048543689320388) internal successors, (155), 140 states have internal predecessors, (155), 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:54:33,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:33,652 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2022-02-20 23:54:33,652 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2022-02-20 23:54:33,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:33,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:33,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 103 states have (on average 1.5048543689320388) internal successors, (155), 140 states have internal predecessors, (155), 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 152 states. [2022-02-20 23:54:33,652 INFO L87 Difference]: Start difference. First operand has 141 states, 103 states have (on average 1.5048543689320388) internal successors, (155), 140 states have internal predecessors, (155), 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 152 states. [2022-02-20 23:54:33,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:33,658 INFO L93 Difference]: Finished difference Result 152 states and 166 transitions. [2022-02-20 23:54:33,658 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 166 transitions. [2022-02-20 23:54:33,658 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:33,658 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:33,658 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:33,658 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 103 states have (on average 1.5048543689320388) internal successors, (155), 140 states have internal predecessors, (155), 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:54:33,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 155 transitions. [2022-02-20 23:54:33,660 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 155 transitions. Word has length 16 [2022-02-20 23:54:33,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:33,660 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 155 transitions. [2022-02-20 23:54:33,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 10 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:54:33,660 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 155 transitions. [2022-02-20 23:54:33,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:54:33,660 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:33,660 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:54:33,661 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:54:33,661 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:54:33,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:33,661 INFO L85 PathProgramCache]: Analyzing trace with hash 743663712, now seen corresponding path program 1 times [2022-02-20 23:54:33,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:33,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925639297] [2022-02-20 23:54:33,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:33,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:33,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:33,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {5736#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {5736#true} is VALID [2022-02-20 23:54:33,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {5736#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {5736#true} is VALID [2022-02-20 23:54:33,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {5736#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {5738#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:33,745 INFO L290 TraceCheckUtils]: 3: Hoare triple {5738#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |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, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {5738#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:33,745 INFO L290 TraceCheckUtils]: 4: Hoare triple {5738#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L998 {5738#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:33,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {5738#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {5738#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:33,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {5738#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {5738#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:33,747 INFO L290 TraceCheckUtils]: 7: Hoare triple {5738#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {5738#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:33,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {5738#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {5739#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (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:54:33,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {5739#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008-6 {5740#(and (= |ULTIMATE.start_main_#t~mem6#1.offset| 0) (= |ULTIMATE.start_main_#t~mem6#1.base| 0))} is VALID [2022-02-20 23:54:33,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {5740#(and (= |ULTIMATE.start_main_#t~mem6#1.offset| 0) (= |ULTIMATE.start_main_#t~mem6#1.base| 0))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {5741#(not |ULTIMATE.start_main_#t~short8#1|)} is VALID [2022-02-20 23:54:33,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {5741#(not |ULTIMATE.start_main_#t~short8#1|)} assume main_#t~short8#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~short8#1 := 0 != main_#t~nondet7#1; {5737#false} is VALID [2022-02-20 23:54:33,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {5737#false} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1;havoc main_#t~short8#1; {5737#false} is VALID [2022-02-20 23:54:33,748 INFO L290 TraceCheckUtils]: 13: Hoare triple {5737#false} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {5737#false} is VALID [2022-02-20 23:54:33,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {5737#false} goto; {5737#false} is VALID [2022-02-20 23:54:33,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {5737#false} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010-5 {5737#false} is VALID [2022-02-20 23:54:33,749 INFO L290 TraceCheckUtils]: 16: Hoare triple {5737#false} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {5737#false} is VALID [2022-02-20 23:54:33,749 INFO L290 TraceCheckUtils]: 17: Hoare triple {5737#false} assume !(1 == #valid[main_~x~0#1.base]); {5737#false} is VALID [2022-02-20 23:54:33,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:33,750 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:33,750 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925639297] [2022-02-20 23:54:33,750 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925639297] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:33,750 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:33,750 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:54:33,750 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735535478] [2022-02-20 23:54:33,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:33,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2022-02-20 23:54:33,751 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:33,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:54:33,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:33,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:54:33,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:33,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:54:33,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:54:33,762 INFO L87 Difference]: Start difference. First operand 141 states and 155 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:54:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:34,178 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2022-02-20 23:54:34,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:54:34,179 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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 18 [2022-02-20 23:54:34,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:34,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:54:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2022-02-20 23:54:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:54:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 149 transitions. [2022-02-20 23:54:34,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 149 transitions. [2022-02-20 23:54:34,268 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:34,269 INFO L225 Difference]: With dead ends: 162 [2022-02-20 23:54:34,269 INFO L226 Difference]: Without dead ends: 162 [2022-02-20 23:54:34,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:54:34,270 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 27 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:34,270 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 442 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:34,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2022-02-20 23:54:34,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 149. [2022-02-20 23:54:34,273 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:34,273 INFO L82 GeneralOperation]: Start isEquivalent. First operand 162 states. Second operand has 149 states, 111 states have (on average 1.4774774774774775) internal successors, (164), 148 states have internal predecessors, (164), 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:54:34,273 INFO L74 IsIncluded]: Start isIncluded. First operand 162 states. Second operand has 149 states, 111 states have (on average 1.4774774774774775) internal successors, (164), 148 states have internal predecessors, (164), 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:54:34,273 INFO L87 Difference]: Start difference. First operand 162 states. Second operand has 149 states, 111 states have (on average 1.4774774774774775) internal successors, (164), 148 states have internal predecessors, (164), 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:54:34,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:34,275 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2022-02-20 23:54:34,275 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2022-02-20 23:54:34,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:34,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:34,275 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 111 states have (on average 1.4774774774774775) internal successors, (164), 148 states have internal predecessors, (164), 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 162 states. [2022-02-20 23:54:34,275 INFO L87 Difference]: Start difference. First operand has 149 states, 111 states have (on average 1.4774774774774775) internal successors, (164), 148 states have internal predecessors, (164), 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 162 states. [2022-02-20 23:54:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:34,281 INFO L93 Difference]: Finished difference Result 162 states and 178 transitions. [2022-02-20 23:54:34,281 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 178 transitions. [2022-02-20 23:54:34,281 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:34,281 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:34,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:34,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:34,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 111 states have (on average 1.4774774774774775) internal successors, (164), 148 states have internal predecessors, (164), 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:54:34,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 164 transitions. [2022-02-20 23:54:34,283 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 164 transitions. Word has length 18 [2022-02-20 23:54:34,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:34,284 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 164 transitions. [2022-02-20 23:54:34,284 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 states have internal predecessors, (18), 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:54:34,284 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 164 transitions. [2022-02-20 23:54:34,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:54:34,284 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:34,284 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:34,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:54:34,285 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:54:34,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:34,285 INFO L85 PathProgramCache]: Analyzing trace with hash -573987105, now seen corresponding path program 1 times [2022-02-20 23:54:34,285 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:34,285 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764069099] [2022-02-20 23:54:34,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:34,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:34,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {6385#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {6385#true} is VALID [2022-02-20 23:54:34,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {6385#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {6385#true} is VALID [2022-02-20 23:54:34,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {6385#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {6385#true} is VALID [2022-02-20 23:54:34,346 INFO L290 TraceCheckUtils]: 3: Hoare triple {6385#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {6385#true} is VALID [2022-02-20 23:54:34,346 INFO L290 TraceCheckUtils]: 4: Hoare triple {6385#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L998 {6385#true} is VALID [2022-02-20 23:54:34,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {6385#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {6385#true} is VALID [2022-02-20 23:54:34,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {6385#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {6385#true} is VALID [2022-02-20 23:54:34,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {6385#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {6385#true} is VALID [2022-02-20 23:54:34,347 INFO L290 TraceCheckUtils]: 8: Hoare triple {6385#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {6385#true} is VALID [2022-02-20 23:54:34,347 INFO L290 TraceCheckUtils]: 9: Hoare triple {6385#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008-6 {6387#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem6#1.offset|) (= |ULTIMATE.start_main_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} is VALID [2022-02-20 23:54:34,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {6387#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem6#1.offset|) (= |ULTIMATE.start_main_#t~mem6#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {6388#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)) |ULTIMATE.start_main_#t~short8#1|)} is VALID [2022-02-20 23:54:34,348 INFO L290 TraceCheckUtils]: 11: Hoare triple {6388#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0)) |ULTIMATE.start_main_#t~short8#1|)} assume !main_#t~short8#1; {6389#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (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:54:34,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {6389#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume !main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1;havoc main_#t~short8#1; {6389#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (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:54:34,349 INFO L290 TraceCheckUtils]: 13: Hoare triple {6389#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {6389#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (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:54:34,349 INFO L290 TraceCheckUtils]: 14: Hoare triple {6389#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} goto; {6389#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (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:54:34,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {6389#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1013-4 {6389#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (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:54:34,350 INFO L290 TraceCheckUtils]: 16: Hoare triple {6389#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0) (= (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~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1015 {6390#(and (= |ULTIMATE.start_main_#t~mem10#1.offset| 0) (= |ULTIMATE.start_main_#t~mem10#1.base| 0))} is VALID [2022-02-20 23:54:34,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {6390#(and (= |ULTIMATE.start_main_#t~mem10#1.offset| 0) (= |ULTIMATE.start_main_#t~mem10#1.base| 0))} assume !(main_#t~mem10#1.base == 0 && main_#t~mem10#1.offset == 0);havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {6386#false} is VALID [2022-02-20 23:54:34,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {6386#false} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1022 {6386#false} is VALID [2022-02-20 23:54:34,351 INFO L290 TraceCheckUtils]: 19: Hoare triple {6386#false} assume !(1 == #valid[main_#t~mem14#1.base]); {6386#false} is VALID [2022-02-20 23:54:34,351 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:54:34,351 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:34,351 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764069099] [2022-02-20 23:54:34,351 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764069099] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:34,352 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:34,352 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:54:34,352 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760968969] [2022-02-20 23:54:34,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:34,352 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2022-02-20 23:54:34,352 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:34,352 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:54:34,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:34,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:54:34,364 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:34,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:54:34,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:54:34,365 INFO L87 Difference]: Start difference. First operand 149 states and 164 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:54:34,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:34,778 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2022-02-20 23:54:34,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:54:34,778 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2022-02-20 23:54:34,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:34,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:54:34,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2022-02-20 23:54:34,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:54:34,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 143 transitions. [2022-02-20 23:54:34,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 143 transitions. [2022-02-20 23:54:34,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:34,861 INFO L225 Difference]: With dead ends: 168 [2022-02-20 23:54:34,861 INFO L226 Difference]: Without dead ends: 168 [2022-02-20 23:54:34,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:54:34,861 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 25 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:34,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 319 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:34,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-02-20 23:54:34,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 159. [2022-02-20 23:54:34,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:34,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 159 states, 121 states have (on average 1.462809917355372) internal successors, (177), 158 states have internal predecessors, (177), 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:54:34,864 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 159 states, 121 states have (on average 1.462809917355372) internal successors, (177), 158 states have internal predecessors, (177), 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:54:34,864 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 159 states, 121 states have (on average 1.462809917355372) internal successors, (177), 158 states have internal predecessors, (177), 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:54:34,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:34,866 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2022-02-20 23:54:34,866 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 183 transitions. [2022-02-20 23:54:34,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:34,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:34,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 121 states have (on average 1.462809917355372) internal successors, (177), 158 states have internal predecessors, (177), 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 168 states. [2022-02-20 23:54:34,866 INFO L87 Difference]: Start difference. First operand has 159 states, 121 states have (on average 1.462809917355372) internal successors, (177), 158 states have internal predecessors, (177), 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 168 states. [2022-02-20 23:54:34,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:34,868 INFO L93 Difference]: Finished difference Result 168 states and 183 transitions. [2022-02-20 23:54:34,868 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 183 transitions. [2022-02-20 23:54:34,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:34,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:34,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:34,869 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:34,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 121 states have (on average 1.462809917355372) internal successors, (177), 158 states have internal predecessors, (177), 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:54:34,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 177 transitions. [2022-02-20 23:54:34,872 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 177 transitions. Word has length 20 [2022-02-20 23:54:34,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:34,873 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 177 transitions. [2022-02-20 23:54:34,873 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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:54:34,873 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 177 transitions. [2022-02-20 23:54:34,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:54:34,873 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:34,873 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:34,874 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:54:34,874 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:54:34,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:34,874 INFO L85 PathProgramCache]: Analyzing trace with hash -1867739349, now seen corresponding path program 1 times [2022-02-20 23:54:34,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:34,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143868804] [2022-02-20 23:54:34,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:34,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:34,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:34,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {7062#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {7062#true} is VALID [2022-02-20 23:54:34,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {7062#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {7062#true} is VALID [2022-02-20 23:54:34,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {7062#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {7062#true} is VALID [2022-02-20 23:54:34,912 INFO L290 TraceCheckUtils]: 3: Hoare triple {7062#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {7062#true} is VALID [2022-02-20 23:54:34,912 INFO L290 TraceCheckUtils]: 4: Hoare triple {7062#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L998 {7062#true} is VALID [2022-02-20 23:54:34,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {7062#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {7062#true} is VALID [2022-02-20 23:54:34,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {7062#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {7062#true} is VALID [2022-02-20 23:54:34,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {7062#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {7062#true} is VALID [2022-02-20 23:54:34,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {7062#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {7062#true} is VALID [2022-02-20 23:54:34,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {7062#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008-6 {7062#true} is VALID [2022-02-20 23:54:34,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {7062#true} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {7062#true} is VALID [2022-02-20 23:54:34,913 INFO L290 TraceCheckUtils]: 11: Hoare triple {7062#true} assume !main_#t~short8#1; {7062#true} is VALID [2022-02-20 23:54:34,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {7062#true} assume !main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1;havoc main_#t~short8#1; {7062#true} is VALID [2022-02-20 23:54:34,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {7062#true} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {7062#true} is VALID [2022-02-20 23:54:34,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {7062#true} goto; {7062#true} is VALID [2022-02-20 23:54:34,913 INFO L290 TraceCheckUtils]: 15: Hoare triple {7062#true} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1013-4 {7062#true} is VALID [2022-02-20 23:54:34,913 INFO L290 TraceCheckUtils]: 16: Hoare triple {7062#true} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1015 {7062#true} is VALID [2022-02-20 23:54:34,914 INFO L290 TraceCheckUtils]: 17: Hoare triple {7062#true} assume main_#t~mem10#1.base == 0 && main_#t~mem10#1.offset == 0;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnHeap(12); {7064#(= (select |#valid| |ULTIMATE.start_main_#t~malloc11#1.base|) 1)} is VALID [2022-02-20 23:54:34,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {7064#(= (select |#valid| |ULTIMATE.start_main_#t~malloc11#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1019 {7065#(= (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:54:34,915 INFO L290 TraceCheckUtils]: 19: Hoare triple {7065#(= (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~malloc11#1.base, main_#t~malloc11#1.offset; {7065#(= (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:54:34,915 INFO L290 TraceCheckUtils]: 20: Hoare triple {7065#(= (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~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1019-2 {7066#(= (select |#valid| |ULTIMATE.start_main_#t~mem12#1.base|) 1)} is VALID [2022-02-20 23:54:34,916 INFO L290 TraceCheckUtils]: 21: Hoare triple {7066#(= (select |#valid| |ULTIMATE.start_main_#t~mem12#1.base|) 1)} assume !(1 == #valid[main_#t~mem12#1.base]); {7063#false} is VALID [2022-02-20 23:54:34,916 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:54:34,916 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:34,916 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143868804] [2022-02-20 23:54:34,916 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143868804] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:34,916 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:34,917 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:54:34,917 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563229874] [2022-02-20 23:54:34,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:34,917 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-02-20 23:54:34,917 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:34,917 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:54:34,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:34,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:54:34,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:34,930 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:54:34,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:34,930 INFO L87 Difference]: Start difference. First operand 159 states and 177 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:54:35,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:35,248 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2022-02-20 23:54:35,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:54:35,256 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-02-20 23:54:35,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:35,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:54:35,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-02-20 23:54:35,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:54:35,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 124 transitions. [2022-02-20 23:54:35,259 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 124 transitions. [2022-02-20 23:54:35,326 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:35,327 INFO L225 Difference]: With dead ends: 158 [2022-02-20 23:54:35,327 INFO L226 Difference]: Without dead ends: 158 [2022-02-20 23:54:35,328 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:54:35,328 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 9 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:35,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 294 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:35,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-02-20 23:54:35,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 158. [2022-02-20 23:54:35,330 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:35,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 158 states. Second operand has 158 states, 121 states have (on average 1.4462809917355373) internal successors, (175), 157 states have internal predecessors, (175), 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:54:35,331 INFO L74 IsIncluded]: Start isIncluded. First operand 158 states. Second operand has 158 states, 121 states have (on average 1.4462809917355373) internal successors, (175), 157 states have internal predecessors, (175), 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:54:35,331 INFO L87 Difference]: Start difference. First operand 158 states. Second operand has 158 states, 121 states have (on average 1.4462809917355373) internal successors, (175), 157 states have internal predecessors, (175), 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:54:35,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:35,333 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2022-02-20 23:54:35,333 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2022-02-20 23:54:35,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:35,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:35,334 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 121 states have (on average 1.4462809917355373) internal successors, (175), 157 states have internal predecessors, (175), 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 158 states. [2022-02-20 23:54:35,334 INFO L87 Difference]: Start difference. First operand has 158 states, 121 states have (on average 1.4462809917355373) internal successors, (175), 157 states have internal predecessors, (175), 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 158 states. [2022-02-20 23:54:35,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:35,335 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2022-02-20 23:54:35,336 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2022-02-20 23:54:35,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:35,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:35,336 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:35,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:35,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 121 states have (on average 1.4462809917355373) internal successors, (175), 157 states have internal predecessors, (175), 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:54:35,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 175 transitions. [2022-02-20 23:54:35,338 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 175 transitions. Word has length 22 [2022-02-20 23:54:35,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:35,338 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 175 transitions. [2022-02-20 23:54:35,338 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:54:35,338 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 175 transitions. [2022-02-20 23:54:35,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:54:35,339 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:35,339 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:35,339 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:54:35,339 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:54:35,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:35,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1867739348, now seen corresponding path program 1 times [2022-02-20 23:54:35,340 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:35,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670588700] [2022-02-20 23:54:35,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:35,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:35,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:35,391 INFO L290 TraceCheckUtils]: 0: Hoare triple {7705#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {7705#true} is VALID [2022-02-20 23:54:35,391 INFO L290 TraceCheckUtils]: 1: Hoare triple {7705#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {7705#true} is VALID [2022-02-20 23:54:35,392 INFO L290 TraceCheckUtils]: 2: Hoare triple {7705#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {7705#true} is VALID [2022-02-20 23:54:35,392 INFO L290 TraceCheckUtils]: 3: Hoare triple {7705#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {7705#true} is VALID [2022-02-20 23:54:35,392 INFO L290 TraceCheckUtils]: 4: Hoare triple {7705#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L998 {7705#true} is VALID [2022-02-20 23:54:35,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {7705#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {7705#true} is VALID [2022-02-20 23:54:35,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {7705#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {7705#true} is VALID [2022-02-20 23:54:35,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {7705#true} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {7705#true} is VALID [2022-02-20 23:54:35,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {7705#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {7705#true} is VALID [2022-02-20 23:54:35,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {7705#true} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008-6 {7705#true} is VALID [2022-02-20 23:54:35,393 INFO L290 TraceCheckUtils]: 10: Hoare triple {7705#true} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {7705#true} is VALID [2022-02-20 23:54:35,393 INFO L290 TraceCheckUtils]: 11: Hoare triple {7705#true} assume !main_#t~short8#1; {7705#true} is VALID [2022-02-20 23:54:35,393 INFO L290 TraceCheckUtils]: 12: Hoare triple {7705#true} assume !main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1;havoc main_#t~short8#1; {7705#true} is VALID [2022-02-20 23:54:35,393 INFO L290 TraceCheckUtils]: 13: Hoare triple {7705#true} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {7705#true} is VALID [2022-02-20 23:54:35,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {7705#true} goto; {7705#true} is VALID [2022-02-20 23:54:35,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {7705#true} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1013-4 {7705#true} is VALID [2022-02-20 23:54:35,394 INFO L290 TraceCheckUtils]: 16: Hoare triple {7705#true} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1015 {7705#true} is VALID [2022-02-20 23:54:35,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {7705#true} assume main_#t~mem10#1.base == 0 && main_#t~mem10#1.offset == 0;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnHeap(12); {7707#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc11#1.base|) 12) (= |ULTIMATE.start_main_#t~malloc11#1.offset| 0))} is VALID [2022-02-20 23:54:35,395 INFO L290 TraceCheckUtils]: 18: Hoare triple {7707#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc11#1.base|) 12) (= |ULTIMATE.start_main_#t~malloc11#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1019 {7708#(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:54:35,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {7708#(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~malloc11#1.base, main_#t~malloc11#1.offset; {7708#(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:54:35,396 INFO L290 TraceCheckUtils]: 20: Hoare triple {7708#(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~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1019-2 {7709#(and (= (+ (select |#length| |ULTIMATE.start_main_#t~mem12#1.base|) (- 12)) 0) (= |ULTIMATE.start_main_#t~mem12#1.offset| 0))} is VALID [2022-02-20 23:54:35,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {7709#(and (= (+ (select |#length| |ULTIMATE.start_main_#t~mem12#1.base|) (- 12)) 0) (= |ULTIMATE.start_main_#t~mem12#1.offset| 0))} assume !(4 + (4 + main_#t~mem12#1.offset) <= #length[main_#t~mem12#1.base] && 0 <= 4 + main_#t~mem12#1.offset); {7706#false} is VALID [2022-02-20 23:54:35,397 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:54:35,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:35,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670588700] [2022-02-20 23:54:35,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670588700] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:35,397 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:35,397 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:54:35,397 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481915960] [2022-02-20 23:54:35,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:35,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-02-20 23:54:35,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:35,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:54:35,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:35,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:54:35,411 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:35,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:54:35,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:54:35,417 INFO L87 Difference]: Start difference. First operand 158 states and 175 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:54:35,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:35,744 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2022-02-20 23:54:35,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:54:35,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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 22 [2022-02-20 23:54:35,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:35,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:54:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2022-02-20 23:54:35,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:54:35,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 123 transitions. [2022-02-20 23:54:35,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 123 transitions. [2022-02-20 23:54:35,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:35,818 INFO L225 Difference]: With dead ends: 157 [2022-02-20 23:54:35,818 INFO L226 Difference]: Without dead ends: 157 [2022-02-20 23:54:35,818 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:54:35,819 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 4 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:35,819 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 284 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:54:35,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-02-20 23:54:35,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-02-20 23:54:35,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:35,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 157 states, 121 states have (on average 1.4297520661157024) internal successors, (173), 156 states have internal predecessors, (173), 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:54:35,821 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 157 states, 121 states have (on average 1.4297520661157024) internal successors, (173), 156 states have internal predecessors, (173), 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:54:35,821 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 157 states, 121 states have (on average 1.4297520661157024) internal successors, (173), 156 states have internal predecessors, (173), 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:54:35,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:35,823 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2022-02-20 23:54:35,823 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2022-02-20 23:54:35,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:35,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:35,824 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 121 states have (on average 1.4297520661157024) internal successors, (173), 156 states have internal predecessors, (173), 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 157 states. [2022-02-20 23:54:35,824 INFO L87 Difference]: Start difference. First operand has 157 states, 121 states have (on average 1.4297520661157024) internal successors, (173), 156 states have internal predecessors, (173), 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 157 states. [2022-02-20 23:54:35,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:35,826 INFO L93 Difference]: Finished difference Result 157 states and 173 transitions. [2022-02-20 23:54:35,826 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2022-02-20 23:54:35,826 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:35,826 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:35,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:35,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:35,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 121 states have (on average 1.4297520661157024) internal successors, (173), 156 states have internal predecessors, (173), 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:54:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 173 transitions. [2022-02-20 23:54:35,828 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 173 transitions. Word has length 22 [2022-02-20 23:54:35,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:35,829 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 173 transitions. [2022-02-20 23:54:35,829 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 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:54:35,829 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 173 transitions. [2022-02-20 23:54:35,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:54:35,829 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:35,829 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:35,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:54:35,830 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:54:35,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:35,830 INFO L85 PathProgramCache]: Analyzing trace with hash 1012469357, now seen corresponding path program 1 times [2022-02-20 23:54:35,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:35,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101063694] [2022-02-20 23:54:35,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:35,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:35,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:35,908 INFO L290 TraceCheckUtils]: 0: Hoare triple {8344#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {8344#true} is VALID [2022-02-20 23:54:35,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {8344#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {8344#true} is VALID [2022-02-20 23:54:35,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {8344#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {8346#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:35,909 INFO L290 TraceCheckUtils]: 3: Hoare triple {8346#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {8346#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:35,910 INFO L290 TraceCheckUtils]: 4: Hoare triple {8346#(= (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 {8346#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:35,910 INFO L290 TraceCheckUtils]: 5: Hoare triple {8346#(= (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; {8346#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:35,911 INFO L290 TraceCheckUtils]: 6: Hoare triple {8346#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {8346#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:35,911 INFO L290 TraceCheckUtils]: 7: Hoare triple {8346#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {8346#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:35,911 INFO L290 TraceCheckUtils]: 8: Hoare triple {8346#(= (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; {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:35,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008-6 {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:35,912 INFO L290 TraceCheckUtils]: 10: Hoare triple {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:35,912 INFO L290 TraceCheckUtils]: 11: Hoare triple {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !main_#t~short8#1; {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:35,913 INFO L290 TraceCheckUtils]: 12: Hoare triple {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1;havoc main_#t~short8#1; {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:35,913 INFO L290 TraceCheckUtils]: 13: Hoare triple {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:35,913 INFO L290 TraceCheckUtils]: 14: Hoare triple {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} goto; {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:35,914 INFO L290 TraceCheckUtils]: 15: Hoare triple {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1013-4 {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:35,914 INFO L290 TraceCheckUtils]: 16: Hoare triple {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1015 {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:35,915 INFO L290 TraceCheckUtils]: 17: Hoare triple {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume main_#t~mem10#1.base == 0 && main_#t~mem10#1.offset == 0;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnHeap(12); {8348#(and (not (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc11#1.base|) 1))} is VALID [2022-02-20 23:54:35,915 INFO L290 TraceCheckUtils]: 18: Hoare triple {8348#(and (not (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc11#1.base|) 1))} SUMMARY for call write~$Pointer$(main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1019 {8349#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:35,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {8349#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~malloc11#1.base, main_#t~malloc11#1.offset; {8349#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:35,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {8349#(and (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1019-2 {8350#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~mem12#1.base|)))} is VALID [2022-02-20 23:54:35,917 INFO L290 TraceCheckUtils]: 21: Hoare triple {8350#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~mem12#1.base|)))} SUMMARY for call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem12#1.base, 4 + main_#t~mem12#1.offset, 4); srcloc: L1019-3 {8351#(= (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:54:35,917 INFO L290 TraceCheckUtils]: 22: Hoare triple {8351#(= (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~mem12#1.base, main_#t~mem12#1.offset; {8351#(= (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:54:35,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {8351#(= (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~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1019-5 {8352#(= 1 (select |#valid| |ULTIMATE.start_main_#t~mem13#1.base|))} is VALID [2022-02-20 23:54:35,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {8352#(= 1 (select |#valid| |ULTIMATE.start_main_#t~mem13#1.base|))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:35,919 INFO L290 TraceCheckUtils]: 25: Hoare triple {8347#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {8345#false} is VALID [2022-02-20 23:54:35,919 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:54:35,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:35,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101063694] [2022-02-20 23:54:35,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101063694] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:35,919 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:35,920 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:54:35,920 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1878610741] [2022-02-20 23:54:35,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:35,920 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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 26 [2022-02-20 23:54:35,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:35,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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:54:35,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:35,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:54:35,939 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:35,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:54:35,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:54:35,939 INFO L87 Difference]: Start difference. First operand 157 states and 173 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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:54:36,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:36,471 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2022-02-20 23:54:36,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:54:36,471 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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 26 [2022-02-20 23:54:36,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:36,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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:54:36,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2022-02-20 23:54:36,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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:54:36,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 127 transitions. [2022-02-20 23:54:36,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 127 transitions. [2022-02-20 23:54:36,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:36,548 INFO L225 Difference]: With dead ends: 157 [2022-02-20 23:54:36,548 INFO L226 Difference]: Without dead ends: 157 [2022-02-20 23:54:36,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:54:36,549 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 144 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 144 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:36,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [144 Valid, 207 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:54:36,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-02-20 23:54:36,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2022-02-20 23:54:36,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:36,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 156 states, 121 states have (on average 1.421487603305785) internal successors, (172), 155 states have internal predecessors, (172), 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:54:36,551 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 156 states, 121 states have (on average 1.421487603305785) internal successors, (172), 155 states have internal predecessors, (172), 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:54:36,551 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 156 states, 121 states have (on average 1.421487603305785) internal successors, (172), 155 states have internal predecessors, (172), 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:54:36,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:36,553 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2022-02-20 23:54:36,553 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 172 transitions. [2022-02-20 23:54:36,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:36,553 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:36,553 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 121 states have (on average 1.421487603305785) internal successors, (172), 155 states have internal predecessors, (172), 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 157 states. [2022-02-20 23:54:36,554 INFO L87 Difference]: Start difference. First operand has 156 states, 121 states have (on average 1.421487603305785) internal successors, (172), 155 states have internal predecessors, (172), 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 157 states. [2022-02-20 23:54:36,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:36,555 INFO L93 Difference]: Finished difference Result 157 states and 172 transitions. [2022-02-20 23:54:36,555 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 172 transitions. [2022-02-20 23:54:36,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:36,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:36,556 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:36,556 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:36,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 121 states have (on average 1.421487603305785) internal successors, (172), 155 states have internal predecessors, (172), 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:54:36,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 172 transitions. [2022-02-20 23:54:36,558 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 172 transitions. Word has length 26 [2022-02-20 23:54:36,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:36,558 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 172 transitions. [2022-02-20 23:54:36,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 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:54:36,558 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 172 transitions. [2022-02-20 23:54:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:54:36,559 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:36,559 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:36,559 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:54:36,559 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:54:36,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:36,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1012469358, now seen corresponding path program 1 times [2022-02-20 23:54:36,559 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:36,560 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412687005] [2022-02-20 23:54:36,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:36,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:36,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:36,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {8994#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {8994#true} is VALID [2022-02-20 23:54:36,668 INFO L290 TraceCheckUtils]: 1: Hoare triple {8994#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {8994#true} is VALID [2022-02-20 23:54:36,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {8994#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {8996#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:36,669 INFO L290 TraceCheckUtils]: 3: Hoare triple {8996#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {8996#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:36,669 INFO L290 TraceCheckUtils]: 4: Hoare triple {8996#(= (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 {8996#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:36,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {8996#(= (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; {8996#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:36,670 INFO L290 TraceCheckUtils]: 6: Hoare triple {8996#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {8996#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:36,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {8996#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {8996#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:36,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {8996#(= (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; {8997#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:36,671 INFO L290 TraceCheckUtils]: 9: Hoare triple {8997#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008-6 {8997#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:36,671 INFO L290 TraceCheckUtils]: 10: Hoare triple {8997#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {8997#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:36,671 INFO L290 TraceCheckUtils]: 11: Hoare triple {8997#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !main_#t~short8#1; {8997#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:36,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {8997#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1;havoc main_#t~short8#1; {8997#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:36,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {8997#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {8997#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:36,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {8997#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} goto; {8997#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:36,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {8997#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1013-4 {8997#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:36,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {8997#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1015 {8997#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:36,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {8997#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume main_#t~mem10#1.base == 0 && main_#t~mem10#1.offset == 0;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset;call main_#t~malloc11#1.base, main_#t~malloc11#1.offset := #Ultimate.allocOnHeap(12); {8998#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc11#1.base|) 12) (not (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_#t~malloc11#1.offset| 0))} is VALID [2022-02-20 23:54:36,674 INFO L290 TraceCheckUtils]: 18: Hoare triple {8998#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc11#1.base|) 12) (not (= |ULTIMATE.start_main_#t~malloc11#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_#t~malloc11#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1019 {8999#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:36,675 INFO L290 TraceCheckUtils]: 19: Hoare triple {8999#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~malloc11#1.base, main_#t~malloc11#1.offset; {8999#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:36,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {8999#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1019-2 {9000#(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) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~mem12#1.base|)))} is VALID [2022-02-20 23:54:36,676 INFO L290 TraceCheckUtils]: 21: Hoare triple {9000#(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) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~mem12#1.base|)))} SUMMARY for call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem12#1.base, 4 + main_#t~mem12#1.offset, 4); srcloc: L1019-3 {9001#(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:54:36,676 INFO L290 TraceCheckUtils]: 22: Hoare triple {9001#(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~mem12#1.base, main_#t~mem12#1.offset; {9001#(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:54:36,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {9001#(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~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1019-5 {9002#(and (= 12 (select |#length| |ULTIMATE.start_main_#t~mem13#1.base|)) (= |ULTIMATE.start_main_#t~mem13#1.offset| 0))} is VALID [2022-02-20 23:54:36,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {9002#(and (= 12 (select |#length| |ULTIMATE.start_main_#t~mem13#1.base|)) (= |ULTIMATE.start_main_#t~mem13#1.offset| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {9003#(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:54:36,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {9003#(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); {8995#false} is VALID [2022-02-20 23:54:36,678 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:54:36,678 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:36,678 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412687005] [2022-02-20 23:54:36,678 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412687005] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:54:36,678 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:54:36,678 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:54:36,678 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043009721] [2022-02-20 23:54:36,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:54:36,679 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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 26 [2022-02-20 23:54:36,679 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:36,679 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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:54:36,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:36,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:54:36,697 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:36,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:54:36,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:54:36,697 INFO L87 Difference]: Start difference. First operand 156 states and 172 transitions. Second operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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:54:37,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:37,371 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2022-02-20 23:54:37,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:54:37,371 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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 26 [2022-02-20 23:54:37,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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:54:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 127 transitions. [2022-02-20 23:54:37,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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:54:37,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 127 transitions. [2022-02-20 23:54:37,373 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 127 transitions. [2022-02-20 23:54:37,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:37,449 INFO L225 Difference]: With dead ends: 156 [2022-02-20 23:54:37,449 INFO L226 Difference]: Without dead ends: 156 [2022-02-20 23:54:37,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:54:37,450 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 141 mSDsluCounter, 184 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:37,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 245 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:54:37,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-02-20 23:54:37,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 154. [2022-02-20 23:54:37,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:37,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 154 states, 121 states have (on average 1.4049586776859504) internal successors, (170), 153 states have internal predecessors, (170), 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:54:37,452 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 154 states, 121 states have (on average 1.4049586776859504) internal successors, (170), 153 states have internal predecessors, (170), 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:54:37,453 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 154 states, 121 states have (on average 1.4049586776859504) internal successors, (170), 153 states have internal predecessors, (170), 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:54:37,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:37,454 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2022-02-20 23:54:37,454 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 171 transitions. [2022-02-20 23:54:37,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:37,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:37,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 121 states have (on average 1.4049586776859504) internal successors, (170), 153 states have internal predecessors, (170), 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 156 states. [2022-02-20 23:54:37,455 INFO L87 Difference]: Start difference. First operand has 154 states, 121 states have (on average 1.4049586776859504) internal successors, (170), 153 states have internal predecessors, (170), 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 156 states. [2022-02-20 23:54:37,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:37,457 INFO L93 Difference]: Finished difference Result 156 states and 171 transitions. [2022-02-20 23:54:37,457 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 171 transitions. [2022-02-20 23:54:37,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:37,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:37,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:37,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:37,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 121 states have (on average 1.4049586776859504) internal successors, (170), 153 states have internal predecessors, (170), 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:54:37,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 170 transitions. [2022-02-20 23:54:37,459 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 170 transitions. Word has length 26 [2022-02-20 23:54:37,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:37,459 INFO L470 AbstractCegarLoop]: Abstraction has 154 states and 170 transitions. [2022-02-20 23:54:37,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.888888888888889) internal successors, (26), 10 states have internal predecessors, (26), 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:54:37,460 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 170 transitions. [2022-02-20 23:54:37,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:54:37,460 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:37,460 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:37,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:54:37,460 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:54:37,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:37,461 INFO L85 PathProgramCache]: Analyzing trace with hash -560637622, now seen corresponding path program 1 times [2022-02-20 23:54:37,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:37,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918435491] [2022-02-20 23:54:37,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:37,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:37,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:37,631 INFO L290 TraceCheckUtils]: 0: Hoare triple {9644#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {9644#true} is VALID [2022-02-20 23:54:37,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {9644#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {9644#true} is VALID [2022-02-20 23:54:37,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {9644#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {9646#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:37,632 INFO L290 TraceCheckUtils]: 3: Hoare triple {9646#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {9646#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:37,632 INFO L290 TraceCheckUtils]: 4: Hoare triple {9646#(= (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 {9646#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:37,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {9646#(= (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; {9647#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:37,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {9647#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {9647#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:37,634 INFO L290 TraceCheckUtils]: 7: Hoare triple {9647#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {9648#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} is VALID [2022-02-20 23:54:37,634 INFO L290 TraceCheckUtils]: 8: Hoare triple {9648#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-3 {9649#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:37,635 INFO L290 TraceCheckUtils]: 9: Hoare triple {9649#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~malloc3#1.base, main_#t~malloc3#1.offset; {9649#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:37,635 INFO L290 TraceCheckUtils]: 10: Hoare triple {9649#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-5 {9650#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= (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:54:37,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {9650#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= (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 write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4); srcloc: L1004-6 {9649#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:37,637 INFO L290 TraceCheckUtils]: 12: Hoare triple {9649#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem4#1.base, main_#t~mem4#1.offset; {9649#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:37,637 INFO L290 TraceCheckUtils]: 13: Hoare triple {9649#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-8 {9651#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:37,642 INFO L290 TraceCheckUtils]: 14: Hoare triple {9651#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {9652#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:37,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {9652#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-10 {9652#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:37,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {9652#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~int(0, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1004-11 {9653#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:37,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {9653#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {9653#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:37,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {9653#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {9653#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:37,646 INFO L290 TraceCheckUtils]: 19: Hoare triple {9653#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {9654#(= (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:54:37,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {9654#(= (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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008-6 {9654#(= (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:54:37,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {9654#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {9654#(= (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:54:37,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {9654#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume main_#t~short8#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~short8#1 := 0 != main_#t~nondet7#1; {9654#(= (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:54:37,647 INFO L290 TraceCheckUtils]: 23: Hoare triple {9654#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1;havoc main_#t~short8#1; {9654#(= (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:54:37,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {9654#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {9654#(= (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:54:37,649 INFO L290 TraceCheckUtils]: 25: Hoare triple {9654#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} goto; {9654#(= (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:54:37,659 INFO L290 TraceCheckUtils]: 26: Hoare triple {9654#(= (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~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010-5 {9655#(= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1)} is VALID [2022-02-20 23:54:37,660 INFO L290 TraceCheckUtils]: 27: Hoare triple {9655#(= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {9656#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:37,660 INFO L290 TraceCheckUtils]: 28: Hoare triple {9656#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {9645#false} is VALID [2022-02-20 23:54:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:37,661 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:37,661 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918435491] [2022-02-20 23:54:37,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918435491] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:54:37,663 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [585407185] [2022-02-20 23:54:37,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:37,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:54:37,663 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:54:37,665 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:54:37,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:54:37,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:37,783 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 38 conjunts are in the unsatisfiable core [2022-02-20 23:54:37,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:37,809 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:37,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:37,977 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:54:37,978 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-20 23:54:38,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:38,135 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:54:38,136 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-02-20 23:54:38,267 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:54:38,267 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-02-20 23:54:38,303 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:54:38,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-02-20 23:54:38,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:54:38,584 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-02-20 23:54:38,716 INFO L290 TraceCheckUtils]: 0: Hoare triple {9644#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {9644#true} is VALID [2022-02-20 23:54:38,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {9644#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {9663#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:38,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {9663#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (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 {9663#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:38,720 INFO L290 TraceCheckUtils]: 3: Hoare triple {9663#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {9663#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:38,721 INFO L290 TraceCheckUtils]: 4: Hoare triple {9663#(and (= |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 {9663#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:38,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {9663#(and (= |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; {9676#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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:54:38,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {9676#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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; {9676#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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:54:38,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {9676#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {9683#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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:54:38,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {9683#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-3 {9687#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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) (= (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:54:38,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {9687#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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) (= (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~malloc3#1.base, main_#t~malloc3#1.offset; {9687#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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) (= (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:54:38,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {9687#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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) (= (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~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-5 {9694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (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:54:38,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {9694#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (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 write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4); srcloc: L1004-6 {9687#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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) (= (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:54:38,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {9687#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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) (= (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~mem4#1.base, main_#t~mem4#1.offset; {9687#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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) (= (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:54:38,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {9687#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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) (= (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~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-8 {9704#(and (= |ULTIMATE.start_main_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:38,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {9704#(and (= |ULTIMATE.start_main_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {9708#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:38,727 INFO L290 TraceCheckUtils]: 15: Hoare triple {9708#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-10 {9708#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:38,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {9708#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~int(0, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1004-11 {9715#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:38,729 INFO L290 TraceCheckUtils]: 17: Hoare triple {9715#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {9715#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:38,729 INFO L290 TraceCheckUtils]: 18: Hoare triple {9715#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {9715#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:38,730 INFO L290 TraceCheckUtils]: 19: Hoare triple {9715#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {9725#(and (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:54:38,730 INFO L290 TraceCheckUtils]: 20: Hoare triple {9725#(and (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008-6 {9729#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:54:38,730 INFO L290 TraceCheckUtils]: 21: Hoare triple {9729#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {9729#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:54:38,731 INFO L290 TraceCheckUtils]: 22: Hoare triple {9729#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} assume main_#t~short8#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~short8#1 := 0 != main_#t~nondet7#1; {9729#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:54:38,731 INFO L290 TraceCheckUtils]: 23: Hoare triple {9729#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1;havoc main_#t~short8#1; {9729#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:54:38,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {9729#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {9729#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:54:38,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {9729#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} goto; {9729#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:54:38,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {9729#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010-5 {9748#(and (exists ((|ULTIMATE.start_main_~x~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_#t~mem9#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))) (= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1))} is VALID [2022-02-20 23:54:38,734 INFO L290 TraceCheckUtils]: 27: Hoare triple {9748#(and (exists ((|ULTIMATE.start_main_~x~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_#t~mem9#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))) (= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {9752#(and (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| Int)) (and (not (= |ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_~x~0#1.base_99|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_99|) 1))))} is VALID [2022-02-20 23:54:38,734 INFO L290 TraceCheckUtils]: 28: Hoare triple {9752#(and (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| Int)) (and (not (= |ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_~x~0#1.base_99|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_99|) 1))))} assume !(1 == #valid[main_~x~0#1.base]); {9645#false} is VALID [2022-02-20 23:54:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:38,734 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:54:39,916 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:54:39,916 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-02-20 23:54:39,944 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:54:39,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 227 [2022-02-20 23:54:39,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 204 [2022-02-20 23:54:39,990 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:54:39,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 196 [2022-02-20 23:54:42,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {9656#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {9645#false} is VALID [2022-02-20 23:54:42,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {9655#(= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {9656#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:54:42,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {9654#(= (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~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010-5 {9655#(= (select |#valid| |ULTIMATE.start_main_#t~mem9#1.base|) 1)} is VALID [2022-02-20 23:54:42,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {9654#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} goto; {9654#(= (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:54:42,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {9654#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {9654#(= (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:54:42,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {9654#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1;havoc main_#t~short8#1; {9654#(= (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:54:42,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {9654#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume main_#t~short8#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~short8#1 := 0 != main_#t~nondet7#1; {9654#(= (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:54:42,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {9654#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {9654#(= (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:54:42,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {9780#(or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (= (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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008-6 {9654#(= (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:54:42,701 INFO L290 TraceCheckUtils]: 19: Hoare triple {9784#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {9780#(or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (= (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:54:42,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {9784#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {9784#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:42,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {9784#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {9784#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:42,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {9794#(forall ((v_ArrVal_485 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_485) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} SUMMARY for call write~int(0, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1004-11 {9784#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:42,705 WARN L290 TraceCheckUtils]: 15: Hoare triple {9794#(forall ((v_ArrVal_485 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_485) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} SUMMARY for call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-10 {9794#(forall ((v_ArrVal_485 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_485) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} is UNKNOWN [2022-02-20 23:54:42,706 INFO L290 TraceCheckUtils]: 14: Hoare triple {9801#(forall ((v_ArrVal_485 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_485) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {9794#(forall ((v_ArrVal_485 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= 1 (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_485) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:42,707 INFO L290 TraceCheckUtils]: 13: Hoare triple {9805#(forall ((v_ArrVal_485 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_485) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-8 {9801#(forall ((v_ArrVal_485 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_485) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:42,708 INFO L290 TraceCheckUtils]: 12: Hoare triple {9805#(forall ((v_ArrVal_485 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_485) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {9805#(forall ((v_ArrVal_485 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_485) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:42,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {9812#(forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= (select |#valid| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_483) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_483) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_485) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} SUMMARY for call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4); srcloc: L1004-6 {9805#(forall ((v_ArrVal_485 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_485) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:42,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {9816#(forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= (select |#valid| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_483) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_483) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_485) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-5 {9812#(forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= (select |#valid| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_483) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_483) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_485) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:42,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {9816#(forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= (select |#valid| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_483) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_483) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_485) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {9816#(forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= (select |#valid| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_483) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_483) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_485) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:42,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {9823#(and (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (forall ((v_arrayElimCell_8 Int)) (= (select |#valid| v_arrayElimCell_8) 1))) (or (forall ((v_arrayElimCell_9 Int)) (= (select |#valid| v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_arrayElimCell_11 Int)) (or (and (or (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|))) (or (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (or (and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)) (and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| v_arrayElimCell_11) 1)))) (and (forall ((v_arrayElimCell_9 Int)) (= (select |#valid| v_arrayElimCell_9) 1)) (or (and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|))))))) (or (forall ((v_arrayElimCell_9 Int)) (= (select |#valid| v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-3 {9816#(forall ((v_ArrVal_483 (Array Int Int)) (v_ArrVal_485 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_76| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_76| 0) (= (select |#valid| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_483) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_483) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_485) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_76|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_76| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:42,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {9827#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (or (forall ((v_arrayElimCell_8 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_8) 1)) (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (or (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_arrayElimCell_11 Int)) (or (and (or (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~x~0#1.base|))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~x~0#1.base|) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_11) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|)))) (and (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (or (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~x~0#1.base|)))))))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {9823#(and (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (forall ((v_arrayElimCell_8 Int)) (= (select |#valid| v_arrayElimCell_8) 1))) (or (forall ((v_arrayElimCell_9 Int)) (= (select |#valid| v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_arrayElimCell_11 Int)) (or (and (or (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|))) (or (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (or (and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)) (and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| v_arrayElimCell_11) 1)))) (and (forall ((v_arrayElimCell_9 Int)) (= (select |#valid| v_arrayElimCell_9) 1)) (or (and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (and (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|) (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|))))))) (or (forall ((v_arrayElimCell_9 Int)) (= (select |#valid| v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)))} is VALID [2022-02-20 23:54:42,716 INFO L290 TraceCheckUtils]: 6: Hoare triple {9827#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (or (forall ((v_arrayElimCell_8 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_8) 1)) (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (or (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_arrayElimCell_11 Int)) (or (and (or (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~x~0#1.base|))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~x~0#1.base|) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_11) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|)))) (and (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (or (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~x~0#1.base|)))))))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {9827#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (or (forall ((v_arrayElimCell_8 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_8) 1)) (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (or (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_arrayElimCell_11 Int)) (or (and (or (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~x~0#1.base|))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~x~0#1.base|) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_11) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|)))) (and (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (or (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~x~0#1.base|)))))))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} is VALID [2022-02-20 23:54:42,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {9834#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (or (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_arrayElimCell_11 Int)) (or (and (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (and (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_11) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (or (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|)))))))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {9827#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (or (forall ((v_arrayElimCell_8 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_8) 1)) (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (or (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_arrayElimCell_11 Int)) (or (and (or (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~x~0#1.base|))) (or (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~x~0#1.base|) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_11) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|)))) (and (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (or (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~x~0#1.base|)))))))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} is VALID [2022-02-20 23:54:42,728 INFO L290 TraceCheckUtils]: 4: Hoare triple {9834#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (or (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_arrayElimCell_11 Int)) (or (and (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (and (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_11) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (or (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|)))))))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L998 {9834#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (or (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_arrayElimCell_11 Int)) (or (and (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (and (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_11) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (or (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|)))))))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} is VALID [2022-02-20 23:54:42,729 INFO L290 TraceCheckUtils]: 3: Hoare triple {9834#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (or (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_arrayElimCell_11 Int)) (or (and (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (and (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_11) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (or (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|)))))))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {9834#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (or (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_arrayElimCell_11 Int)) (or (and (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (and (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_11) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (or (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|)))))))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} is VALID [2022-02-20 23:54:42,731 INFO L290 TraceCheckUtils]: 2: Hoare triple {9834#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (or (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_arrayElimCell_11 Int)) (or (and (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (and (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_11) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (or (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|)))))))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {9834#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (or (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_arrayElimCell_11 Int)) (or (and (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (and (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_11) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (or (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|)))))))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} is VALID [2022-02-20 23:54:42,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {9644#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {9834#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (and (or (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (<= |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (forall ((v_arrayElimCell_11 Int)) (or (and (forall ((v_arrayElimCell_9 Int)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_9) 1)) (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (and (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6| 1) v_arrayElimCell_11) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|))) (or (not (= v_arrayElimCell_11 |ULTIMATE.start_main_~head~0#1.base|)) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_6| |ULTIMATE.start_main_~head~0#1.base|)))))))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_6|) 0))))} is VALID [2022-02-20 23:54:42,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {9644#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {9644#true} is VALID [2022-02-20 23:54:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:42,732 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [585407185] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:54:42,732 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:54:42,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2022-02-20 23:54:42,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045794425] [2022-02-20 23:54:42,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:54:42,734 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 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 29 [2022-02-20 23:54:42,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:42,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 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:54:42,815 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 76 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:42,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-02-20 23:54:42,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:42,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-02-20 23:54:42,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1000, Unknown=20, NotChecked=0, Total=1190 [2022-02-20 23:54:42,816 INFO L87 Difference]: Start difference. First operand 154 states and 170 transitions. Second operand has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 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:54:44,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:44,789 INFO L93 Difference]: Finished difference Result 232 states and 255 transitions. [2022-02-20 23:54:44,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:54:44,789 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 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 29 [2022-02-20 23:54:44,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:44,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 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:54:44,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 226 transitions. [2022-02-20 23:54:44,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 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:54:44,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 226 transitions. [2022-02-20 23:54:44,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 226 transitions. [2022-02-20 23:54:44,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:44,965 INFO L225 Difference]: With dead ends: 232 [2022-02-20 23:54:44,965 INFO L226 Difference]: Without dead ends: 232 [2022-02-20 23:54:44,966 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=1337, Unknown=20, NotChecked=0, Total=1640 [2022-02-20 23:54:44,966 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 721 mSDsluCounter, 745 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 721 SdHoareTripleChecker+Valid, 813 SdHoareTripleChecker+Invalid, 1840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 915 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:44,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [721 Valid, 813 Invalid, 1840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 817 Invalid, 0 Unknown, 915 Unchecked, 0.7s Time] [2022-02-20 23:54:44,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-02-20 23:54:44,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 175. [2022-02-20 23:54:44,968 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:44,969 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 175 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 174 states have internal predecessors, (195), 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:54:44,969 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 175 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 174 states have internal predecessors, (195), 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:54:44,969 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 175 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 174 states have internal predecessors, (195), 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:54:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:44,973 INFO L93 Difference]: Finished difference Result 232 states and 255 transitions. [2022-02-20 23:54:44,973 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 255 transitions. [2022-02-20 23:54:44,973 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:44,973 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:44,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 174 states have internal predecessors, (195), 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 232 states. [2022-02-20 23:54:44,974 INFO L87 Difference]: Start difference. First operand has 175 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 174 states have internal predecessors, (195), 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 232 states. [2022-02-20 23:54:44,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:44,977 INFO L93 Difference]: Finished difference Result 232 states and 255 transitions. [2022-02-20 23:54:44,977 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 255 transitions. [2022-02-20 23:54:44,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:44,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:44,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:44,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 142 states have (on average 1.3732394366197183) internal successors, (195), 174 states have internal predecessors, (195), 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:54:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 195 transitions. [2022-02-20 23:54:44,981 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 195 transitions. Word has length 29 [2022-02-20 23:54:44,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:44,981 INFO L470 AbstractCegarLoop]: Abstraction has 175 states and 195 transitions. [2022-02-20 23:54:44,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.264705882352941) internal successors, (77), 35 states have internal predecessors, (77), 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:54:44,982 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 195 transitions. [2022-02-20 23:54:44,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:54:44,982 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:44,982 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:45,001 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:45,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-20 23:54:45,191 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:54:45,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:45,192 INFO L85 PathProgramCache]: Analyzing trace with hash -560637621, now seen corresponding path program 1 times [2022-02-20 23:54:45,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:45,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128822528] [2022-02-20 23:54:45,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:45,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:45,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:45,401 INFO L290 TraceCheckUtils]: 0: Hoare triple {10734#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {10734#true} is VALID [2022-02-20 23:54:45,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {10734#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {10734#true} is VALID [2022-02-20 23:54:45,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {10734#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {10736#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:45,401 INFO L290 TraceCheckUtils]: 3: Hoare triple {10736#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {10736#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:45,402 INFO L290 TraceCheckUtils]: 4: Hoare triple {10736#(= (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 {10736#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:45,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {10736#(= (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; {10737#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:45,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {10737#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {10737#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:45,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {10737#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {10738#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 12))} is VALID [2022-02-20 23:54:45,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {10738#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) 12))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-3 {10739#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:45,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {10739#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {10739#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:45,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {10739#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-5 {10740#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= (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:54:45,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {10740#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4); srcloc: L1004-6 {10739#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:45,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {10739#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {10739#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:45,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {10739#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-8 {10741#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:45,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {10741#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {10742#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:45,409 INFO L290 TraceCheckUtils]: 15: Hoare triple {10742#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-10 {10742#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:45,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {10742#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 12) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~int(0, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1004-11 {10743#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:45,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {10743#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {10743#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:45,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {10743#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {10743#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:45,412 INFO L290 TraceCheckUtils]: 19: Hoare triple {10743#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {10744#(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:54:45,412 INFO L290 TraceCheckUtils]: 20: Hoare triple {10744#(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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008-6 {10744#(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:54:45,412 INFO L290 TraceCheckUtils]: 21: Hoare triple {10744#(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))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {10744#(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:54:45,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {10744#(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))} assume main_#t~short8#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~short8#1 := 0 != main_#t~nondet7#1; {10744#(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:54:45,413 INFO L290 TraceCheckUtils]: 23: Hoare triple {10744#(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))} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1;havoc main_#t~short8#1; {10744#(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:54:45,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {10744#(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))} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {10744#(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:54:45,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {10744#(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))} goto; {10744#(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:54:45,414 INFO L290 TraceCheckUtils]: 26: Hoare triple {10744#(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~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010-5 {10745#(and (= 12 (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|)) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0))} is VALID [2022-02-20 23:54:45,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {10745#(and (= 12 (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|)) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {10746#(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:54:45,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {10746#(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); {10735#false} is VALID [2022-02-20 23:54:45,415 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:45,416 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:45,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128822528] [2022-02-20 23:54:45,416 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128822528] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:54:45,416 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [449266569] [2022-02-20 23:54:45,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:45,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:54:45,416 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:54:45,417 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:54:45,418 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:54:45,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:45,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 52 conjunts are in the unsatisfiable core [2022-02-20 23:54:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:45,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:45,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:45,623 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:54:45,623 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:54:45,645 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:45,711 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:45,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:45,839 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:54:45,840 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-02-20 23:54:45,847 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-20 23:54:45,980 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:54:45,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-02-20 23:54:45,985 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:54:45,999 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:54:46,000 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-02-20 23:54:46,046 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:54:46,047 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-02-20 23:54:46,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-20 23:54:46,324 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:54:46,324 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:54:46,353 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:54:46,354 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:54:46,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-02-20 23:54:46,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {10734#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {10734#true} is VALID [2022-02-20 23:54:46,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {10734#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {10753#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:46,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {10753#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (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 {10753#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:46,418 INFO L290 TraceCheckUtils]: 3: Hoare triple {10753#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {10753#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:46,418 INFO L290 TraceCheckUtils]: 4: Hoare triple {10753#(and (= |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 {10753#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:46,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {10753#(and (= |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; {10766#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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:54:46,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {10766#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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; {10766#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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:54:46,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {10766#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {10773#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|)))} is VALID [2022-02-20 23:54:46,421 INFO L290 TraceCheckUtils]: 8: Hoare triple {10773#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#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_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-3 {10777#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (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:54:46,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {10777#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {10777#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (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:54:46,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {10777#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (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~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-5 {10784#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= (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:54:46,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {10784#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4); srcloc: L1004-6 {10777#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (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:54:46,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {10777#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {10777#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (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:54:46,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {10777#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (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~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-8 {10794#(and (= |ULTIMATE.start_main_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:46,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {10794#(and (= |ULTIMATE.start_main_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {10798#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:46,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {10798#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-10 {10798#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:46,426 INFO L290 TraceCheckUtils]: 16: Hoare triple {10798#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~int(0, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1004-11 {10805#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:46,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {10805#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {10805#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:46,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {10805#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {10805#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:54:46,427 INFO L290 TraceCheckUtils]: 19: Hoare triple {10805#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {10815#(and (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} is VALID [2022-02-20 23:54:46,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {10815#(and (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008-6 {10819#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} is VALID [2022-02-20 23:54:46,428 INFO L290 TraceCheckUtils]: 21: Hoare triple {10819#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {10819#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} is VALID [2022-02-20 23:54:46,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {10819#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} assume main_#t~short8#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~short8#1 := 0 != main_#t~nondet7#1; {10819#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} is VALID [2022-02-20 23:54:46,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {10819#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1;havoc main_#t~short8#1; {10819#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} is VALID [2022-02-20 23:54:46,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {10819#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {10819#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} is VALID [2022-02-20 23:54:46,430 INFO L290 TraceCheckUtils]: 25: Hoare triple {10819#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} goto; {10819#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} is VALID [2022-02-20 23:54:46,431 INFO L290 TraceCheckUtils]: 26: Hoare triple {10819#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010-5 {10838#(and (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|)) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0))} is VALID [2022-02-20 23:54:46,431 INFO L290 TraceCheckUtils]: 27: Hoare triple {10838#(and (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|)) (= |ULTIMATE.start_main_#t~mem9#1.offset| 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {10842#(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:54:46,432 INFO L290 TraceCheckUtils]: 28: Hoare triple {10842#(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); {10735#false} is VALID [2022-02-20 23:54:46,432 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:46,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:54:48,292 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:54:48,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 103 [2022-02-20 23:54:48,311 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:54:48,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 103 treesize of output 79 [2022-02-20 23:54:48,358 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:54:48,358 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 386 treesize of output 349 [2022-02-20 23:54:48,438 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:54:48,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 967 treesize of output 930 [2022-02-20 23:54:48,489 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 899 treesize of output 883 [2022-02-20 23:54:48,513 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 883 treesize of output 851 [2022-02-20 23:54:48,537 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 851 treesize of output 819 [2022-02-20 23:54:48,567 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:54:48,567 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 819 treesize of output 772 [2022-02-20 23:54:48,596 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 763 treesize of output 751 [2022-02-20 23:54:48,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 751 treesize of output 745 [2022-02-20 23:54:48,658 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 745 treesize of output 733 [2022-02-20 23:54:49,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {10846#(and (<= (+ |ULTIMATE.start_main_~x~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|))} assume !(4 + main_~x~0#1.offset <= #length[main_~x~0#1.base] && 0 <= main_~x~0#1.offset); {10735#false} is VALID [2022-02-20 23:54:49,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {10850#(and (<= 0 |ULTIMATE.start_main_#t~mem9#1.offset|) (<= (+ |ULTIMATE.start_main_#t~mem9#1.offset| 4) (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|)))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {10846#(and (<= (+ |ULTIMATE.start_main_~x~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (<= 0 |ULTIMATE.start_main_~x~0#1.offset|))} is VALID [2022-02-20 23:54:49,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {10854#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010-5 {10850#(and (<= 0 |ULTIMATE.start_main_#t~mem9#1.offset|) (<= (+ |ULTIMATE.start_main_#t~mem9#1.offset| 4) (select |#length| |ULTIMATE.start_main_#t~mem9#1.base|)))} is VALID [2022-02-20 23:54:49,589 INFO L290 TraceCheckUtils]: 25: Hoare triple {10854#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} goto; {10854#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:49,589 INFO L290 TraceCheckUtils]: 24: Hoare triple {10854#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {10854#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:49,590 INFO L290 TraceCheckUtils]: 23: Hoare triple {10854#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} assume !!main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1;havoc main_#t~short8#1; {10854#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:49,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {10854#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} assume main_#t~short8#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~short8#1 := 0 != main_#t~nondet7#1; {10854#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:49,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {10854#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {10854#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:49,591 INFO L290 TraceCheckUtils]: 20: Hoare triple {10873#(or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008-6 {10854#(and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))))} is VALID [2022-02-20 23:54:49,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {10877#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|)) (and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)))))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {10873#(or (< |ULTIMATE.start_main_~x~0#1.offset| 0) (and (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)))))} is VALID [2022-02-20 23:54:49,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {10877#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|)) (and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)))))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {10877#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|)) (and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)))))} is VALID [2022-02-20 23:54:49,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {10877#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|)) (and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {10877#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|)) (and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)))))} is VALID [2022-02-20 23:54:49,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {10887#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (and (forall ((v_ArrVal_588 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |#length| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_589) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|))))} SUMMARY for call write~int(0, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1004-11 {10877#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|)) (and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)))))} is VALID [2022-02-20 23:54:49,606 WARN L290 TraceCheckUtils]: 15: Hoare triple {10887#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (and (forall ((v_ArrVal_588 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |#length| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_589) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|))))} SUMMARY for call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-10 {10887#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (and (forall ((v_ArrVal_588 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |#length| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_589) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|))))} is UNKNOWN [2022-02-20 23:54:49,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {10894#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (and (forall ((v_ArrVal_588 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |#length| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_589) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|))))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {10887#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (and (forall ((v_ArrVal_588 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |#length| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_589) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:49,609 INFO L290 TraceCheckUtils]: 13: Hoare triple {10898#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (and (forall ((v_ArrVal_588 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_589) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))))) (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|))))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-8 {10894#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (and (forall ((v_ArrVal_588 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |#length| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_589) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:49,610 INFO L290 TraceCheckUtils]: 12: Hoare triple {10898#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (and (forall ((v_ArrVal_588 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_589) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))))) (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|))))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {10898#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (and (forall ((v_ArrVal_588 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_589) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))))) (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:49,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {10905#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|)) (and (forall ((v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= 0 (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_585) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_584) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= (+ (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_585) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_584) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |#length| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_584) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_584) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_589) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)))))))} SUMMARY for call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4); srcloc: L1004-6 {10898#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (and (forall ((v_ArrVal_588 (Array Int Int))) (<= 0 (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= (+ (select (select (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |#length| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_589) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))))) (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:49,647 WARN L290 TraceCheckUtils]: 10: Hoare triple {10909#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (and (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= (+ 4 (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_585) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_584) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_584) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_584) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_589) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)))) (forall ((v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= 0 (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_585) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_584) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|))))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-5 {10905#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|)) (and (forall ((v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= 0 (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_585) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_584) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|))) (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= (+ (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_585) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_584) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|) 4) (select |#length| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_584) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_584) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_589) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)))))))} is UNKNOWN [2022-02-20 23:54:49,655 WARN L290 TraceCheckUtils]: 9: Hoare triple {10909#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (and (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= (+ 4 (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_585) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_584) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_584) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_584) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_589) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)))) (forall ((v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= 0 (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_585) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_584) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|))))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {10909#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (and (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= (+ 4 (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_585) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_584) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_584) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_584) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_589) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)))) (forall ((v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= 0 (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_585) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_584) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|))))} is UNKNOWN [2022-02-20 23:54:49,657 INFO L290 TraceCheckUtils]: 8: Hoare triple {10916#(and (or (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (<= (+ |ULTIMATE.start_main_#t~malloc3#1.offset| 4) (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|)) (<= 0 |ULTIMATE.start_main_#t~malloc3#1.offset|))) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-3 {10909#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_81| Int)) (or (< |v_ULTIMATE.start_main_~x~0#1.offset_81| 0) (and (forall ((v_ArrVal_589 (Array Int Int)) (v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= (+ 4 (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_585) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_584) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)) (select |#length| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_584) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_584) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_589) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)))) (forall ((v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int)) (v_ArrVal_588 (Array Int Int))) (<= 0 (select (select (store (store |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_585) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_584) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_588) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_81|)))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_81| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:49,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {10920#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_9| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9|) 0)) (and (or (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_9| |ULTIMATE.start_main_~x~0#1.base|))) (or (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))))} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {10916#(and (or (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (<= (+ |ULTIMATE.start_main_#t~malloc3#1.offset| 4) (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|)) (<= 0 |ULTIMATE.start_main_#t~malloc3#1.offset|))) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 23:54:49,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {10920#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_9| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9|) 0)) (and (or (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_9| |ULTIMATE.start_main_~x~0#1.base|))) (or (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {10920#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_9| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9|) 0)) (and (or (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_9| |ULTIMATE.start_main_~x~0#1.base|))) (or (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))))} is VALID [2022-02-20 23:54:49,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {10927#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_9| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9|) 0)) (and (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (or (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_9| |ULTIMATE.start_main_~head~0#1.base|)) (< |ULTIMATE.start_main_~head~0#1.offset| 0)))))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {10920#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_9| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9|) 0)) (and (or (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_9| |ULTIMATE.start_main_~x~0#1.base|))) (or (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))))} is VALID [2022-02-20 23:54:49,660 INFO L290 TraceCheckUtils]: 4: Hoare triple {10927#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_9| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9|) 0)) (and (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (or (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_9| |ULTIMATE.start_main_~head~0#1.base|)) (< |ULTIMATE.start_main_~head~0#1.offset| 0)))))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L998 {10927#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_9| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9|) 0)) (and (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (or (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_9| |ULTIMATE.start_main_~head~0#1.base|)) (< |ULTIMATE.start_main_~head~0#1.offset| 0)))))} is VALID [2022-02-20 23:54:49,661 INFO L290 TraceCheckUtils]: 3: Hoare triple {10927#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_9| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9|) 0)) (and (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (or (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_9| |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, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {10927#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_9| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9|) 0)) (and (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (or (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_9| |ULTIMATE.start_main_~head~0#1.base|)) (< |ULTIMATE.start_main_~head~0#1.offset| 0)))))} is VALID [2022-02-20 23:54:49,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {10927#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_9| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9|) 0)) (and (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (or (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_9| |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 {10927#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_9| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9|) 0)) (and (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (or (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_9| |ULTIMATE.start_main_~head~0#1.base|)) (< |ULTIMATE.start_main_~head~0#1.offset| 0)))))} is VALID [2022-02-20 23:54:49,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {10734#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {10927#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_9| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_9|) 0)) (and (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (or (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_9| |ULTIMATE.start_main_~head~0#1.base|)) (< |ULTIMATE.start_main_~head~0#1.offset| 0)))))} is VALID [2022-02-20 23:54:49,662 INFO L290 TraceCheckUtils]: 0: Hoare triple {10734#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {10734#true} is VALID [2022-02-20 23:54:49,662 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:49,662 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [449266569] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:54:49,662 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:54:49,662 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 37 [2022-02-20 23:54:49,663 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677698634] [2022-02-20 23:54:49,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:54:49,664 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 38 states have internal predecessors, (85), 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 29 [2022-02-20 23:54:49,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:49,664 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 38 states have internal predecessors, (85), 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:54:49,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 82 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:49,762 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-02-20 23:54:49,762 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:49,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-02-20 23:54:49,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1251, Unknown=23, NotChecked=0, Total=1406 [2022-02-20 23:54:49,763 INFO L87 Difference]: Start difference. First operand 175 states and 195 transitions. Second operand has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 38 states have internal predecessors, (85), 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:54:53,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:53,773 INFO L93 Difference]: Finished difference Result 283 states and 312 transitions. [2022-02-20 23:54:53,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 23:54:53,773 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 38 states have internal predecessors, (85), 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 29 [2022-02-20 23:54:53,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:54:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 38 states have internal predecessors, (85), 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:54:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 291 transitions. [2022-02-20 23:54:53,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 38 states have internal predecessors, (85), 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:54:53,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 291 transitions. [2022-02-20 23:54:53,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 291 transitions. [2022-02-20 23:54:54,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:54,004 INFO L225 Difference]: With dead ends: 283 [2022-02-20 23:54:54,005 INFO L226 Difference]: Without dead ends: 283 [2022-02-20 23:54:54,005 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 586 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=471, Invalid=2698, Unknown=23, NotChecked=0, Total=3192 [2022-02-20 23:54:54,006 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 751 mSDsluCounter, 1224 mSDsCounter, 0 mSdLazyCounter, 1609 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1319 SdHoareTripleChecker+Invalid, 2694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 928 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:54:54,006 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [751 Valid, 1319 Invalid, 2694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1609 Invalid, 0 Unknown, 928 Unchecked, 1.3s Time] [2022-02-20 23:54:54,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2022-02-20 23:54:54,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 173. [2022-02-20 23:54:54,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:54:54,009 INFO L82 GeneralOperation]: Start isEquivalent. First operand 283 states. Second operand has 173 states, 146 states have (on average 1.356164383561644) internal successors, (198), 172 states have internal predecessors, (198), 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:54:54,010 INFO L74 IsIncluded]: Start isIncluded. First operand 283 states. Second operand has 173 states, 146 states have (on average 1.356164383561644) internal successors, (198), 172 states have internal predecessors, (198), 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:54:54,010 INFO L87 Difference]: Start difference. First operand 283 states. Second operand has 173 states, 146 states have (on average 1.356164383561644) internal successors, (198), 172 states have internal predecessors, (198), 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:54:54,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:54,013 INFO L93 Difference]: Finished difference Result 283 states and 312 transitions. [2022-02-20 23:54:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 312 transitions. [2022-02-20 23:54:54,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:54,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:54,014 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 146 states have (on average 1.356164383561644) internal successors, (198), 172 states have internal predecessors, (198), 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 283 states. [2022-02-20 23:54:54,014 INFO L87 Difference]: Start difference. First operand has 173 states, 146 states have (on average 1.356164383561644) internal successors, (198), 172 states have internal predecessors, (198), 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 283 states. [2022-02-20 23:54:54,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:54:54,020 INFO L93 Difference]: Finished difference Result 283 states and 312 transitions. [2022-02-20 23:54:54,020 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 312 transitions. [2022-02-20 23:54:54,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:54:54,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:54:54,021 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:54:54,021 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:54:54,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 146 states have (on average 1.356164383561644) internal successors, (198), 172 states have internal predecessors, (198), 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:54:54,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 198 transitions. [2022-02-20 23:54:54,023 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 198 transitions. Word has length 29 [2022-02-20 23:54:54,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:54:54,023 INFO L470 AbstractCegarLoop]: Abstraction has 173 states and 198 transitions. [2022-02-20 23:54:54,023 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 37 states have (on average 2.2972972972972974) internal successors, (85), 38 states have internal predecessors, (85), 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:54:54,024 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 198 transitions. [2022-02-20 23:54:54,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:54:54,024 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:54:54,024 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:54:54,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:54:54,241 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-02-20 23:54:54,242 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:54:54,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:54:54,242 INFO L85 PathProgramCache]: Analyzing trace with hash -557177017, now seen corresponding path program 1 times [2022-02-20 23:54:54,242 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:54:54,242 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708556278] [2022-02-20 23:54:54,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:54,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:54:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:54,395 INFO L290 TraceCheckUtils]: 0: Hoare triple {12005#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {12005#true} is VALID [2022-02-20 23:54:54,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {12005#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {12005#true} is VALID [2022-02-20 23:54:54,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {12005#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {12007#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:54,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {12007#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {12007#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:54,396 INFO L290 TraceCheckUtils]: 4: Hoare triple {12007#(= (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 {12007#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:54:54,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {12007#(= (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; {12008#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:54,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {12008#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {12008#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:54,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {12008#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {12009#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} is VALID [2022-02-20 23:54:54,398 INFO L290 TraceCheckUtils]: 8: Hoare triple {12009#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-3 {12010#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:54,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {12010#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~malloc3#1.base, main_#t~malloc3#1.offset; {12010#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:54,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {12010#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-5 {12011#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= (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:54:54,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {12011#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= (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 write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4); srcloc: L1004-6 {12010#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:54,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {12010#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem4#1.base, main_#t~mem4#1.offset; {12010#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:54:54,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {12010#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-8 {12012#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:54,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {12012#(and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {12013#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:54,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {12013#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-10 {12013#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:54,403 INFO L290 TraceCheckUtils]: 16: Hoare triple {12013#(and (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~int(0, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1004-11 {12014#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:54,403 INFO L290 TraceCheckUtils]: 17: Hoare triple {12014#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {12014#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:54,403 INFO L290 TraceCheckUtils]: 18: Hoare triple {12014#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {12014#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} is VALID [2022-02-20 23:54:54,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {12014#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1)} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {12015#(= (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:54:54,404 INFO L290 TraceCheckUtils]: 20: Hoare triple {12015#(= (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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008-6 {12015#(= (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:54:54,404 INFO L290 TraceCheckUtils]: 21: Hoare triple {12015#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {12015#(= (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:54:54,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {12015#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume main_#t~short8#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~short8#1 := 0 != main_#t~nondet7#1; {12015#(= (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:54:54,405 INFO L290 TraceCheckUtils]: 23: Hoare triple {12015#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume !main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1;havoc main_#t~short8#1; {12015#(= (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:54:54,405 INFO L290 TraceCheckUtils]: 24: Hoare triple {12015#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {12015#(= (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:54:54,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {12015#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} goto; {12015#(= (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:54:54,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {12015#(= (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 write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1013-4 {12015#(= (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:54:54,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {12015#(= (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~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1015 {12015#(= (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:54:54,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {12015#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume !(main_#t~mem10#1.base == 0 && main_#t~mem10#1.offset == 0);havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {12015#(= (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:54:54,407 INFO L290 TraceCheckUtils]: 29: Hoare triple {12015#(= (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~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1022 {12016#(= (select |#valid| |ULTIMATE.start_main_#t~mem14#1.base|) 1)} is VALID [2022-02-20 23:54:54,407 INFO L290 TraceCheckUtils]: 30: Hoare triple {12016#(= (select |#valid| |ULTIMATE.start_main_#t~mem14#1.base|) 1)} assume !(1 == #valid[main_#t~mem14#1.base]); {12006#false} is VALID [2022-02-20 23:54:54,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:54,408 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:54:54,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708556278] [2022-02-20 23:54:54,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708556278] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:54:54,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558761964] [2022-02-20 23:54:54,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:54:54,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:54:54,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:54:54,410 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:54:54,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 23:54:54,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:54,510 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 36 conjunts are in the unsatisfiable core [2022-02-20 23:54:54,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:54:54,521 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:54:54,527 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:54:54,603 INFO L356 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-02-20 23:54:54,603 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-02-20 23:54:54,674 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:54:54,764 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:54:54,764 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-02-20 23:54:54,886 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:54:54,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-02-20 23:54:54,909 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:54:54,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2022-02-20 23:54:55,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:54:55,115 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-02-20 23:54:55,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:54:55,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-02-20 23:54:55,285 INFO L290 TraceCheckUtils]: 0: Hoare triple {12005#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {12005#true} is VALID [2022-02-20 23:54:55,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {12005#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {12023#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:55,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {12023#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (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 {12023#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:55,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {12023#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {12023#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:55,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {12023#(and (= |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 {12023#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:54:55,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {12023#(and (= |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; {12036#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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:54:55,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {12036#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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; {12036#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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:54:55,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {12036#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {12043#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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:54:55,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {12043#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-3 {12047#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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) (= (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:54:55,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {12047#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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) (= (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~malloc3#1.base, main_#t~malloc3#1.offset; {12047#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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) (= (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:54:55,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {12047#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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) (= (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~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-5 {12054#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (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:54:55,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {12054#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= (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 write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4); srcloc: L1004-6 {12047#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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) (= (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:54:55,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {12047#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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) (= (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~mem4#1.base, main_#t~mem4#1.offset; {12047#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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) (= (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:54:55,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {12047#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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) (= (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~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-8 {12064#(and (= |ULTIMATE.start_main_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:55,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {12064#(and (= |ULTIMATE.start_main_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {12068#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:55,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {12068#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-10 {12068#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:55,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {12068#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} SUMMARY for call write~int(0, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1004-11 {12075#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:55,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {12075#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {12075#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:55,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {12075#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {12075#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} is VALID [2022-02-20 23:54:55,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {12075#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |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) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) 1))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {12085#(and (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:54:55,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {12085#(and (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008-6 {12089#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:54:55,297 INFO L290 TraceCheckUtils]: 21: Hoare triple {12089#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {12089#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:54:55,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {12089#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} assume main_#t~short8#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~short8#1 := 0 != main_#t~nondet7#1; {12089#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:54:55,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {12089#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} assume !main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1;havoc main_#t~short8#1; {12089#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:54:55,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {12089#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {12089#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:54:55,299 INFO L290 TraceCheckUtils]: 25: Hoare triple {12089#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} goto; {12089#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:54:55,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {12089#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1013-4 {12089#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:54:55,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {12089#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1015 {12089#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:54:55,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {12089#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} assume !(main_#t~mem10#1.base == 0 && main_#t~mem10#1.offset == 0);havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {12089#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:54:55,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {12089#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1022 {12117#(and (exists ((|ULTIMATE.start_main_~x~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~mem14#1.base|)))) (= (select |#valid| |ULTIMATE.start_main_#t~mem14#1.base|) 1))} is VALID [2022-02-20 23:54:55,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {12117#(and (exists ((|ULTIMATE.start_main_~x~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~mem14#1.base|)))) (= (select |#valid| |ULTIMATE.start_main_#t~mem14#1.base|) 1))} assume !(1 == #valid[main_#t~mem14#1.base]); {12006#false} is VALID [2022-02-20 23:54:55,302 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:55,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:54:56,309 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:54:56,310 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 31 [2022-02-20 23:54:56,359 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:54:56,359 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 252 treesize of output 227 [2022-02-20 23:54:56,386 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 212 treesize of output 204 [2022-02-20 23:54:56,409 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:54:56,409 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 204 treesize of output 196 [2022-02-20 23:54:59,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {12016#(= (select |#valid| |ULTIMATE.start_main_#t~mem14#1.base|) 1)} assume !(1 == #valid[main_#t~mem14#1.base]); {12006#false} is VALID [2022-02-20 23:54:59,485 INFO L290 TraceCheckUtils]: 29: Hoare triple {12015#(= (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~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1022 {12016#(= (select |#valid| |ULTIMATE.start_main_#t~mem14#1.base|) 1)} is VALID [2022-02-20 23:54:59,485 INFO L290 TraceCheckUtils]: 28: Hoare triple {12015#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume !(main_#t~mem10#1.base == 0 && main_#t~mem10#1.offset == 0);havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {12015#(= (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:54:59,486 INFO L290 TraceCheckUtils]: 27: Hoare triple {12015#(= (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~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1015 {12015#(= (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:54:59,486 INFO L290 TraceCheckUtils]: 26: Hoare triple {12015#(= (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 write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1013-4 {12015#(= (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:54:59,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {12015#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} goto; {12015#(= (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:54:59,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {12015#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {12015#(= (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:54:59,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {12015#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume !main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1;havoc main_#t~short8#1; {12015#(= (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:54:59,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {12015#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume main_#t~short8#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~short8#1 := 0 != main_#t~nondet7#1; {12015#(= (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:54:59,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {12015#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {12015#(= (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:54:59,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {12151#(or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (= (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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008-6 {12015#(= (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:54:59,489 INFO L290 TraceCheckUtils]: 19: Hoare triple {12155#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_85| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {12151#(or (not (<= 0 |ULTIMATE.start_main_~x~0#1.offset|)) (= (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:54:59,489 INFO L290 TraceCheckUtils]: 18: Hoare triple {12155#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_85| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {12155#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_85| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:59,489 INFO L290 TraceCheckUtils]: 17: Hoare triple {12155#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_85| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {12155#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_85| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:59,490 INFO L290 TraceCheckUtils]: 16: Hoare triple {12165#(forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_700) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} SUMMARY for call write~int(0, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1004-11 {12155#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_85| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:59,493 WARN L290 TraceCheckUtils]: 15: Hoare triple {12165#(forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_700) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} SUMMARY for call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-10 {12165#(forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_700) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} is UNKNOWN [2022-02-20 23:54:59,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {12172#(forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_700) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {12165#(forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_700) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:59,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {12176#(forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int)) (or (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_700) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-8 {12172#(forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int)) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_700) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:59,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {12176#(forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int)) (or (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_700) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {12176#(forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int)) (or (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_700) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:59,496 INFO L290 TraceCheckUtils]: 11: Hoare triple {12183#(forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int) (v_ArrVal_698 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select |#valid| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_698) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_698) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_700) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} SUMMARY for call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4); srcloc: L1004-6 {12176#(forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int)) (or (= (select |#valid| (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_700) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:59,497 INFO L290 TraceCheckUtils]: 10: Hoare triple {12187#(forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int) (v_ArrVal_698 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select |#valid| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_698) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_698) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_700) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-5 {12183#(forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int) (v_ArrVal_698 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select |#valid| (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_698) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_698) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_700) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:59,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {12187#(forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int) (v_ArrVal_698 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select |#valid| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_698) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_698) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_700) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {12187#(forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int) (v_ArrVal_698 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select |#valid| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_698) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_698) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_700) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:59,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {12194#(or (forall ((v_arrayElimCell_45 Int)) (= (select |#valid| v_arrayElimCell_45) 1)) (and (or (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (forall ((v_arrayElimCell_44 Int)) (or (and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| v_arrayElimCell_44) 1) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (and (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_44))) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))))) (or (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0))))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-3 {12187#(forall ((v_ArrVal_700 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_85| Int) (v_ArrVal_698 (Array Int Int))) (or (not (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_85|)) (= (select |#valid| (select (select (store (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_698) (select (select (store |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_698) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_700) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_85|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_85| |ULTIMATE.start_main_~head~0#1.offset|))))} is VALID [2022-02-20 23:54:59,500 INFO L290 TraceCheckUtils]: 7: Hoare triple {12198#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_12| Int) (v_arrayElimCell_45 Int)) (or (and (forall ((v_arrayElimCell_44 Int)) (or (and (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_12| v_arrayElimCell_44))) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))) (and (not (= |ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| 1) v_arrayElimCell_44) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_12| |ULTIMATE.start_main_~head~0#1.base|))))) (or (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0))) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| 1) v_arrayElimCell_45) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|) 0))))} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {12194#(or (forall ((v_arrayElimCell_45 Int)) (= (select |#valid| v_arrayElimCell_45) 1)) (and (or (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (forall ((v_arrayElimCell_44 Int)) (or (and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select |#valid| v_arrayElimCell_44) 1) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|))) (and (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |ULTIMATE.start_main_#t~malloc3#1.base| v_arrayElimCell_44))) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))))) (or (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0))))} is VALID [2022-02-20 23:54:59,501 INFO L290 TraceCheckUtils]: 6: Hoare triple {12198#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_12| Int) (v_arrayElimCell_45 Int)) (or (and (forall ((v_arrayElimCell_44 Int)) (or (and (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_12| v_arrayElimCell_44))) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))) (and (not (= |ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| 1) v_arrayElimCell_44) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_12| |ULTIMATE.start_main_~head~0#1.base|))))) (or (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0))) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| 1) v_arrayElimCell_45) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|) 0))))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {12198#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_12| Int) (v_arrayElimCell_45 Int)) (or (and (forall ((v_arrayElimCell_44 Int)) (or (and (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_12| v_arrayElimCell_44))) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))) (and (not (= |ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| 1) v_arrayElimCell_44) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_12| |ULTIMATE.start_main_~head~0#1.base|))))) (or (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0))) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| 1) v_arrayElimCell_45) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|) 0))))} is VALID [2022-02-20 23:54:59,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {12205#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_12| Int) (v_arrayElimCell_45 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| 1) v_arrayElimCell_45) 1) (and (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_12| |ULTIMATE.start_main_~head~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|) 0))))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {12198#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_12| Int) (v_arrayElimCell_45 Int)) (or (and (forall ((v_arrayElimCell_44 Int)) (or (and (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_12| v_arrayElimCell_44))) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|))) (and (not (= |ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|)) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| 1) v_arrayElimCell_44) 1) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_12| |ULTIMATE.start_main_~head~0#1.base|))))) (or (<= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (or (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (< |ULTIMATE.start_main_~head~0#1.offset| 0))) (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| 1) v_arrayElimCell_45) 1) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|) 0))))} is VALID [2022-02-20 23:54:59,503 INFO L290 TraceCheckUtils]: 4: Hoare triple {12205#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_12| Int) (v_arrayElimCell_45 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| 1) v_arrayElimCell_45) 1) (and (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_12| |ULTIMATE.start_main_~head~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|) 0))))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L998 {12205#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_12| Int) (v_arrayElimCell_45 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| 1) v_arrayElimCell_45) 1) (and (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_12| |ULTIMATE.start_main_~head~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|) 0))))} is VALID [2022-02-20 23:54:59,504 INFO L290 TraceCheckUtils]: 3: Hoare triple {12205#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_12| Int) (v_arrayElimCell_45 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| 1) v_arrayElimCell_45) 1) (and (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_12| |ULTIMATE.start_main_~head~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|) 0))))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {12205#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_12| Int) (v_arrayElimCell_45 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| 1) v_arrayElimCell_45) 1) (and (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_12| |ULTIMATE.start_main_~head~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|) 0))))} is VALID [2022-02-20 23:54:59,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {12205#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_12| Int) (v_arrayElimCell_45 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| 1) v_arrayElimCell_45) 1) (and (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_12| |ULTIMATE.start_main_~head~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|) 0))))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {12205#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_12| Int) (v_arrayElimCell_45 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| 1) v_arrayElimCell_45) 1) (and (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_12| |ULTIMATE.start_main_~head~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|) 0))))} is VALID [2022-02-20 23:54:59,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {12005#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {12205#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_12| Int) (v_arrayElimCell_45 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12| 1) v_arrayElimCell_45) 1) (and (<= |ULTIMATE.start_main_~head~0#1.offset| 0) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (not (= |v_ULTIMATE.start_main_#t~malloc3#1.base_12| |ULTIMATE.start_main_~head~0#1.base|)))) (not (= (select |#valid| |v_ULTIMATE.start_main_#t~malloc3#1.base_12|) 0))))} is VALID [2022-02-20 23:54:59,505 INFO L290 TraceCheckUtils]: 0: Hoare triple {12005#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {12005#true} is VALID [2022-02-20 23:54:59,506 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:54:59,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558761964] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:54:59,506 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:54:59,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 13] total 32 [2022-02-20 23:54:59,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743331100] [2022-02-20 23:54:59,506 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:54:59,506 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.53125) internal successors, (81), 33 states have internal predecessors, (81), 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 31 [2022-02-20 23:54:59,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:54:59,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 33 states, 32 states have (on average 2.53125) internal successors, (81), 33 states have internal predecessors, (81), 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:54:59,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 80 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:54:59,573 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-02-20 23:54:59,573 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:54:59,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-02-20 23:54:59,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=885, Unknown=20, NotChecked=0, Total=1056 [2022-02-20 23:54:59,573 INFO L87 Difference]: Start difference. First operand 173 states and 198 transitions. Second operand has 33 states, 32 states have (on average 2.53125) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:01,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:01,088 INFO L93 Difference]: Finished difference Result 243 states and 274 transitions. [2022-02-20 23:55:01,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:55:01,088 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 2.53125) internal successors, (81), 33 states have internal predecessors, (81), 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 31 [2022-02-20 23:55:01,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:01,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 2.53125) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:01,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 214 transitions. [2022-02-20 23:55:01,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 2.53125) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:01,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 214 transitions. [2022-02-20 23:55:01,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 214 transitions. [2022-02-20 23:55:01,251 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:01,254 INFO L225 Difference]: With dead ends: 243 [2022-02-20 23:55:01,254 INFO L226 Difference]: Without dead ends: 243 [2022-02-20 23:55:01,255 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 4 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 412 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=245, Invalid=1217, Unknown=20, NotChecked=0, Total=1482 [2022-02-20 23:55:01,255 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 627 mSDsluCounter, 700 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 959 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:01,256 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [627 Valid, 784 Invalid, 1598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 549 Invalid, 0 Unknown, 959 Unchecked, 0.4s Time] [2022-02-20 23:55:01,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2022-02-20 23:55:01,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 180. [2022-02-20 23:55:01,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:01,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 243 states. Second operand has 180 states, 153 states have (on average 1.3529411764705883) internal successors, (207), 179 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:01,269 INFO L74 IsIncluded]: Start isIncluded. First operand 243 states. Second operand has 180 states, 153 states have (on average 1.3529411764705883) internal successors, (207), 179 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:01,269 INFO L87 Difference]: Start difference. First operand 243 states. Second operand has 180 states, 153 states have (on average 1.3529411764705883) internal successors, (207), 179 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:01,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:01,272 INFO L93 Difference]: Finished difference Result 243 states and 274 transitions. [2022-02-20 23:55:01,272 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 274 transitions. [2022-02-20 23:55:01,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:01,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:01,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 153 states have (on average 1.3529411764705883) internal successors, (207), 179 states have internal predecessors, (207), 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 243 states. [2022-02-20 23:55:01,273 INFO L87 Difference]: Start difference. First operand has 180 states, 153 states have (on average 1.3529411764705883) internal successors, (207), 179 states have internal predecessors, (207), 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 243 states. [2022-02-20 23:55:01,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:01,276 INFO L93 Difference]: Finished difference Result 243 states and 274 transitions. [2022-02-20 23:55:01,276 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 274 transitions. [2022-02-20 23:55:01,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:01,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:01,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:01,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:01,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 153 states have (on average 1.3529411764705883) internal successors, (207), 179 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:01,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 207 transitions. [2022-02-20 23:55:01,278 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 207 transitions. Word has length 31 [2022-02-20 23:55:01,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:01,279 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 207 transitions. [2022-02-20 23:55:01,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 2.53125) internal successors, (81), 33 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:01,279 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 207 transitions. [2022-02-20 23:55:01,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:55:01,279 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:01,279 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:01,319 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 23:55:01,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-20 23:55:01,497 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:55:01,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:01,498 INFO L85 PathProgramCache]: Analyzing trace with hash -557177016, now seen corresponding path program 1 times [2022-02-20 23:55:01,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:55:01,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930572770] [2022-02-20 23:55:01,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:01,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:55:01,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:01,739 INFO L290 TraceCheckUtils]: 0: Hoare triple {13145#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {13145#true} is VALID [2022-02-20 23:55:01,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {13145#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {13145#true} is VALID [2022-02-20 23:55:01,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {13145#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L997 {13147#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:55:01,740 INFO L290 TraceCheckUtils]: 3: Hoare triple {13147#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {13147#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:55:01,740 INFO L290 TraceCheckUtils]: 4: Hoare triple {13147#(= (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 {13147#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:55:01,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {13147#(= (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; {13148#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:55:01,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {13148#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {13148#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:55:01,741 INFO L290 TraceCheckUtils]: 7: Hoare triple {13148#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} assume !!(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {13149#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= 12 (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|)))} is VALID [2022-02-20 23:55:01,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {13149#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (<= 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_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-3 {13150#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:55:01,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {13150#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {13150#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:55:01,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {13150#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-5 {13151#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= (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:55:01,744 INFO L290 TraceCheckUtils]: 11: Hoare triple {13151#(and (not (= |ULTIMATE.start_main_#t~mem4#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4); srcloc: L1004-6 {13150#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:55:01,745 INFO L290 TraceCheckUtils]: 12: Hoare triple {13150#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {13150#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:55:01,745 INFO L290 TraceCheckUtils]: 13: Hoare triple {13150#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-8 {13152#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:55:01,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {13152#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {13153#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:55:01,746 INFO L290 TraceCheckUtils]: 15: Hoare triple {13153#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-10 {13153#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:55:01,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {13153#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~int(0, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1004-11 {13154#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:55:01,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {13154#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {13154#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:55:01,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {13154#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {13154#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:55:01,748 INFO L290 TraceCheckUtils]: 19: Hoare triple {13154#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:55:01,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008-6 {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:55:01,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:55:01,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume main_#t~short8#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~short8#1 := 0 != main_#t~nondet7#1; {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:55:01,750 INFO L290 TraceCheckUtils]: 23: Hoare triple {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume !main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1;havoc main_#t~short8#1; {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:55:01,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:55:01,751 INFO L290 TraceCheckUtils]: 25: Hoare triple {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} goto; {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:55:01,751 INFO L290 TraceCheckUtils]: 26: Hoare triple {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1013-4 {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:55:01,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1015 {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:55:01,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} assume !(main_#t~mem10#1.base == 0 && main_#t~mem10#1.offset == 0);havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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:55:01,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {13155#(and (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (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~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1022 {13156#(and (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem14#1.base|)) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|))} is VALID [2022-02-20 23:55:01,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {13156#(and (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem14#1.base|)) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|))} assume !(4 + (8 + main_#t~mem14#1.offset) <= #length[main_#t~mem14#1.base] && 0 <= 8 + main_#t~mem14#1.offset); {13146#false} is VALID [2022-02-20 23:55:01,754 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:01,754 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:55:01,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930572770] [2022-02-20 23:55:01,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930572770] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:55:01,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1302308414] [2022-02-20 23:55:01,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:01,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:55:01,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:55:01,755 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:55:01,756 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 23:55:01,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:01,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 52 conjunts are in the unsatisfiable core [2022-02-20 23:55:01,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:01,870 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:01,877 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:55:01,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:55:01,985 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:55:01,986 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:55:02,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:55:02,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:55:02,185 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:55:02,185 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-02-20 23:55:02,191 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-20 23:55:02,310 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:55:02,311 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-02-20 23:55:02,315 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:55:02,329 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:55:02,329 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-02-20 23:55:02,367 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:55:02,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-02-20 23:55:02,376 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-20 23:55:02,612 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:02,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:02,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:02,621 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 26 [2022-02-20 23:55:02,726 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:55:02,727 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:55:02,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:55:02,758 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:55:02,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 16 [2022-02-20 23:55:02,783 INFO L290 TraceCheckUtils]: 0: Hoare triple {13145#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {13145#true} is VALID [2022-02-20 23:55:02,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {13145#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~short8#1, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~malloc11#1.base, main_#t~malloc11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1, main_#t~mem19#1, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~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; {13163#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:55:02,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {13163#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (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 {13163#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:55:02,785 INFO L290 TraceCheckUtils]: 3: Hoare triple {13163#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L997-1 {13163#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:55:02,785 INFO L290 TraceCheckUtils]: 4: Hoare triple {13163#(and (= |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 {13163#(and (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:55:02,785 INFO L290 TraceCheckUtils]: 5: Hoare triple {13163#(and (= |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; {13176#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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:55:02,786 INFO L290 TraceCheckUtils]: 6: Hoare triple {13176#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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; {13176#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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:55:02,786 INFO L290 TraceCheckUtils]: 7: Hoare triple {13176#(and (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| |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;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {13183#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|)))} is VALID [2022-02-20 23:55:02,787 INFO L290 TraceCheckUtils]: 8: Hoare triple {13183#(and (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#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_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-3 {13187#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (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:55:02,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {13187#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {13187#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (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:55:02,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {13187#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (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~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-5 {13194#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= (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:55:02,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {13194#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem4#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, 4 + main_#t~mem4#1.offset, 4); srcloc: L1004-6 {13187#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (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:55:02,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {13187#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {13187#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (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:55:02,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {13187#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| |ULTIMATE.start_main_~x~0#1.offset|) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (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~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-8 {13204#(and (= |ULTIMATE.start_main_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:55:02,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {13204#(and (= |ULTIMATE.start_main_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {13208#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:55:02,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {13208#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1004-10 {13208#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:55:02,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {13208#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} SUMMARY for call write~int(0, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1004-11 {13215#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:55:02,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {13215#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {13215#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:55:02,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {13215#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} assume !(0 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {13215#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} is VALID [2022-02-20 23:55:02,794 INFO L290 TraceCheckUtils]: 19: Hoare triple {13215#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~head~0#1.base|)) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) 0))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {13225#(and (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} is VALID [2022-02-20 23:55:02,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {13225#(and (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1008-6 {13229#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} is VALID [2022-02-20 23:55:02,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {13229#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} main_#t~short8#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {13229#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} is VALID [2022-02-20 23:55:02,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {13229#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} assume main_#t~short8#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_#t~short8#1 := 0 != main_#t~nondet7#1; {13229#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} is VALID [2022-02-20 23:55:02,796 INFO L290 TraceCheckUtils]: 23: Hoare triple {13229#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} assume !main_#t~short8#1;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1;havoc main_#t~short8#1; {13229#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} is VALID [2022-02-20 23:55:02,797 INFO L290 TraceCheckUtils]: 24: Hoare triple {13229#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} assume !!(main_~x~0#1.base != 0 || main_~x~0#1.offset != 0); {13229#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} is VALID [2022-02-20 23:55:02,797 INFO L290 TraceCheckUtils]: 25: Hoare triple {13229#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} goto; {13229#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} is VALID [2022-02-20 23:55:02,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {13229#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1013-4 {13229#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} is VALID [2022-02-20 23:55:02,798 INFO L290 TraceCheckUtils]: 27: Hoare triple {13229#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1015 {13229#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} is VALID [2022-02-20 23:55:02,806 INFO L290 TraceCheckUtils]: 28: Hoare triple {13229#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} assume !(main_#t~mem10#1.base == 0 && main_#t~mem10#1.offset == 0);havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {13229#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} is VALID [2022-02-20 23:55:02,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {13229#(and (<= 0 |ULTIMATE.start_main_~x~0#1.offset|) (<= |ULTIMATE.start_main_~x~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0) |ULTIMATE.start_main_~x~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) 0) 0) (<= 12 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0))))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1022 {13156#(and (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem14#1.base|)) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|))} is VALID [2022-02-20 23:55:02,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {13156#(and (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem14#1.base|)) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|))} assume !(4 + (8 + main_#t~mem14#1.offset) <= #length[main_#t~mem14#1.base] && 0 <= 8 + main_#t~mem14#1.offset); {13146#false} is VALID [2022-02-20 23:55:02,808 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:02,808 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:55:04,845 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:55:04,845 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 112 treesize of output 105 [2022-02-20 23:55:04,860 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:55:04,860 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 81 [2022-02-20 23:55:04,913 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:55:04,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 688 treesize of output 619 [2022-02-20 23:55:04,994 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:55:04,995 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1795 treesize of output 1722 [2022-02-20 23:55:05,042 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1691 treesize of output 1627 [2022-02-20 23:55:05,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1627 treesize of output 1595 [2022-02-20 23:55:05,089 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1595 treesize of output 1531 [2022-02-20 23:55:05,120 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:55:05,121 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1531 treesize of output 1432 [2022-02-20 23:55:05,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1423 treesize of output 1407 [2022-02-20 23:55:05,181 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1407 treesize of output 1399 [2022-02-20 23:55:05,216 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1399 treesize of output 1387 [2022-02-20 23:55:05,275 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 23:55:05,292 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 23:55:05,491 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:55:05,492 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 23:55:05,496 INFO L158 Benchmark]: Toolchain (without parser) took 38789.50ms. Allocated memory was 111.1MB in the beginning and 299.9MB in the end (delta: 188.7MB). Free memory was 81.8MB in the beginning and 130.8MB in the end (delta: -49.0MB). Peak memory consumption was 138.0MB. Max. memory is 16.1GB. [2022-02-20 23:55:05,496 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 111.1MB. Free memory is still 66.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:55:05,496 INFO L158 Benchmark]: CACSL2BoogieTranslator took 312.93ms. Allocated memory is still 111.1MB. Free memory was 81.5MB in the beginning and 76.1MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:55:05,496 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.77ms. Allocated memory is still 111.1MB. Free memory was 76.1MB in the beginning and 73.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:55:05,496 INFO L158 Benchmark]: Boogie Preprocessor took 26.83ms. Allocated memory is still 111.1MB. Free memory was 73.7MB in the beginning and 71.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:55:05,496 INFO L158 Benchmark]: RCFGBuilder took 627.89ms. Allocated memory was 111.1MB in the beginning and 172.0MB in the end (delta: 60.8MB). Free memory was 71.2MB in the beginning and 133.0MB in the end (delta: -61.8MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. [2022-02-20 23:55:05,496 INFO L158 Benchmark]: TraceAbstraction took 37771.86ms. Allocated memory was 172.0MB in the beginning and 299.9MB in the end (delta: 127.9MB). Free memory was 132.1MB in the beginning and 130.8MB in the end (delta: 1.4MB). Peak memory consumption was 129.3MB. Max. memory is 16.1GB. [2022-02-20 23:55:05,499 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.11ms. Allocated memory is still 111.1MB. Free memory is still 66.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 312.93ms. Allocated memory is still 111.1MB. Free memory was 81.5MB in the beginning and 76.1MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.77ms. Allocated memory is still 111.1MB. Free memory was 76.1MB in the beginning and 73.7MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.83ms. Allocated memory is still 111.1MB. Free memory was 73.7MB in the beginning and 71.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 627.89ms. Allocated memory was 111.1MB in the beginning and 172.0MB in the end (delta: 60.8MB). Free memory was 71.2MB in the beginning and 133.0MB in the end (delta: -61.8MB). Peak memory consumption was 22.3MB. Max. memory is 16.1GB. * TraceAbstraction took 37771.86ms. Allocated memory was 172.0MB in the beginning and 299.9MB in the end (delta: 127.9MB). Free memory was 132.1MB in the beginning and 130.8MB in the end (delta: 1.4MB). Peak memory consumption was 129.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 23:55:05,526 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-reverse.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:55:07,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:55:07,133 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:55:07,164 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:55:07,165 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:55:07,168 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:55:07,170 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:55:07,174 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:55:07,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:55:07,179 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:55:07,180 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:55:07,183 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:55:07,184 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:55:07,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:55:07,189 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:55:07,189 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:55:07,190 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:55:07,190 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:55:07,191 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:55:07,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:55:07,193 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:55:07,197 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:55:07,197 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:55:07,199 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:55:07,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:55:07,204 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:55:07,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:55:07,205 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:55:07,206 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:55:07,207 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:55:07,207 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:55:07,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:55:07,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:55:07,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:55:07,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:55:07,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:55:07,211 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:55:07,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:55:07,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:55:07,212 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:55:07,213 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:55:07,216 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:55:07,248 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:55:07,248 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:55:07,249 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:55:07,250 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:55:07,250 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:55:07,250 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:55:07,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:55:07,251 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:55:07,252 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:55:07,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:55:07,252 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:55:07,253 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:55:07,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:55:07,253 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:55:07,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:55:07,253 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:55:07,253 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:55:07,253 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:55:07,254 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:55:07,254 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:55:07,254 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:55:07,254 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:55:07,254 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:55:07,254 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:55:07,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:55:07,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:55:07,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:55:07,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:55:07,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:55:07,255 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:55:07,255 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:55:07,255 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:55:07,256 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:55:07,256 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52fc70d7844651686a4c27e057f507f0498e7d5f7c17f07a035699d1630f6ea2 [2022-02-20 23:55:07,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:55:07,506 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:55:07,509 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:55:07,510 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:55:07,515 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:55:07,517 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-reverse.i [2022-02-20 23:55:07,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff134fb42/df2d74a98b724e48adc3671c065a0a22/FLAG558edc4c9 [2022-02-20 23:55:07,990 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:55:07,990 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-reverse.i [2022-02-20 23:55:08,000 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff134fb42/df2d74a98b724e48adc3671c065a0a22/FLAG558edc4c9 [2022-02-20 23:55:08,008 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ff134fb42/df2d74a98b724e48adc3671c065a0a22 [2022-02-20 23:55:08,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:55:08,011 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:55:08,012 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:55:08,012 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:55:08,015 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:55:08,016 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:55:08" (1/1) ... [2022-02-20 23:55:08,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f27f69f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:08, skipping insertion in model container [2022-02-20 23:55:08,017 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:55:08" (1/1) ... [2022-02-20 23:55:08,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:55:08,061 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:55:08,322 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/dll-reverse.i[22309,22322] [2022-02-20 23:55:08,325 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/dll-reverse.i[22394,22407] [2022-02-20 23:55:08,335 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/dll-reverse.i[22924,22937] [2022-02-20 23:55:08,346 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:55:08,357 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:55:08,387 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/dll-reverse.i[22309,22322] [2022-02-20 23:55:08,391 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/dll-reverse.i[22394,22407] [2022-02-20 23:55:08,404 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/dll-reverse.i[22924,22937] [2022-02-20 23:55:08,410 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:55:08,437 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:55:08,438 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:08 WrapperNode [2022-02-20 23:55:08,438 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:55:08,439 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:55:08,439 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:55:08,439 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:55:08,444 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:08" (1/1) ... [2022-02-20 23:55:08,474 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:08" (1/1) ... [2022-02-20 23:55:08,499 INFO L137 Inliner]: procedures = 122, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 141 [2022-02-20 23:55:08,500 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:55:08,500 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:55:08,500 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:55:08,501 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:55:08,507 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:08" (1/1) ... [2022-02-20 23:55:08,507 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:08" (1/1) ... [2022-02-20 23:55:08,519 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:08" (1/1) ... [2022-02-20 23:55:08,520 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:08" (1/1) ... [2022-02-20 23:55:08,530 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:08" (1/1) ... [2022-02-20 23:55:08,538 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:08" (1/1) ... [2022-02-20 23:55:08,544 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:08" (1/1) ... [2022-02-20 23:55:08,549 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:55:08,551 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:55:08,553 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:55:08,554 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:55:08,555 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:08" (1/1) ... [2022-02-20 23:55:08,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:55:08,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:55:08,591 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:55:08,620 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:55:08,645 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:55:08,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:55:08,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:55:08,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:55:08,646 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:55:08,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:55:08,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:55:08,646 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:55:08,646 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:55:08,647 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:55:08,725 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:55:08,726 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:55:09,316 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:55:09,321 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:55:09,322 INFO L299 CfgBuilder]: Removed 11 assume(true) statements. [2022-02-20 23:55:09,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:55:09 BoogieIcfgContainer [2022-02-20 23:55:09,323 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:55:09,324 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:55:09,324 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:55:09,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:55:09,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:55:08" (1/3) ... [2022-02-20 23:55:09,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e438b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:55:09, skipping insertion in model container [2022-02-20 23:55:09,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:55:08" (2/3) ... [2022-02-20 23:55:09,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@25e438b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:55:09, skipping insertion in model container [2022-02-20 23:55:09,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:55:09" (3/3) ... [2022-02-20 23:55:09,328 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-reverse.i [2022-02-20 23:55:09,332 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:55:09,332 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 69 error locations. [2022-02-20 23:55:09,359 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:55:09,365 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:55:09,365 INFO L340 AbstractCegarLoop]: Starting to check reachability of 69 error locations. [2022-02-20 23:55:09,383 INFO L276 IsEmpty]: Start isEmpty. Operand has 146 states, 76 states have (on average 2.1973684210526314) internal successors, (167), 145 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:09,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:55:09,386 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:09,387 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:55:09,387 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:55:09,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:09,393 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:55:09,402 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:09,402 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299338658] [2022-02-20 23:55:09,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:09,403 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:09,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:09,405 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:09,423 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:55:09,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:09,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:55:09,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:09,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:09,553 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:55:09,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {149#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {149#true} is VALID [2022-02-20 23:55:09,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);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; {157#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:09,568 INFO L290 TraceCheckUtils]: 2: Hoare triple {157#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~head~0#1.base]); {150#false} is VALID [2022-02-20 23:55:09,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:09,568 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:09,569 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:09,569 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299338658] [2022-02-20 23:55:09,570 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299338658] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:09,570 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:09,570 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:55:09,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772262430] [2022-02-20 23:55:09,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:09,577 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:55:09,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:09,580 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:55:09,584 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:55:09,585 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:55:09,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:09,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:55:09,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:55:09,609 INFO L87 Difference]: Start difference. First operand has 146 states, 76 states have (on average 2.1973684210526314) internal successors, (167), 145 states have internal predecessors, (167), 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:55:10,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:10,125 INFO L93 Difference]: Finished difference Result 143 states and 150 transitions. [2022-02-20 23:55:10,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:55:10,125 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:55:10,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:10,126 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:55:10,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2022-02-20 23:55:10,132 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:55:10,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2022-02-20 23:55:10,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 167 transitions. [2022-02-20 23:55:10,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:10,293 INFO L225 Difference]: With dead ends: 143 [2022-02-20 23:55:10,293 INFO L226 Difference]: Without dead ends: 141 [2022-02-20 23:55:10,294 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:55:10,296 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 96 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:10,297 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [96 Valid, 124 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:55:10,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-02-20 23:55:10,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-02-20 23:55:10,318 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:10,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 141 states, 75 states have (on average 1.9733333333333334) internal successors, (148), 140 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:10,320 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 141 states, 75 states have (on average 1.9733333333333334) internal successors, (148), 140 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:10,320 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 141 states, 75 states have (on average 1.9733333333333334) internal successors, (148), 140 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:10,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:10,325 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2022-02-20 23:55:10,325 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 148 transitions. [2022-02-20 23:55:10,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:10,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:10,327 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 75 states have (on average 1.9733333333333334) internal successors, (148), 140 states have internal predecessors, (148), 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:55:10,327 INFO L87 Difference]: Start difference. First operand has 141 states, 75 states have (on average 1.9733333333333334) internal successors, (148), 140 states have internal predecessors, (148), 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:55:10,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:10,332 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2022-02-20 23:55:10,332 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 148 transitions. [2022-02-20 23:55:10,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:10,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:10,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:10,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:10,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 75 states have (on average 1.9733333333333334) internal successors, (148), 140 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:10,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 148 transitions. [2022-02-20 23:55:10,338 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 148 transitions. Word has length 3 [2022-02-20 23:55:10,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:10,338 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 148 transitions. [2022-02-20 23:55:10,338 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:55:10,338 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 148 transitions. [2022-02-20 23:55:10,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:55:10,339 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:10,339 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:55:10,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:55:10,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:10,546 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:55:10,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:10,546 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:55:10,547 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:10,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [285995657] [2022-02-20 23:55:10,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:10,547 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:10,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:10,548 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:10,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:55:10,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:10,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:55:10,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:10,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:10,634 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:55:10,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {726#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {726#true} is VALID [2022-02-20 23:55:10,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {726#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);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; {734#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:10,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {734#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} assume !((~bvule32(~bvadd32(4bv32, main_~head~0#1.offset), #length[main_~head~0#1.base]) && ~bvule32(main_~head~0#1.offset, ~bvadd32(4bv32, main_~head~0#1.offset))) && ~bvule32(0bv32, main_~head~0#1.offset)); {727#false} is VALID [2022-02-20 23:55:10,644 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:10,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:10,644 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:10,644 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [285995657] [2022-02-20 23:55:10,644 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [285995657] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:10,645 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:10,645 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:55:10,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825557257] [2022-02-20 23:55:10,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:10,647 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:55:10,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:10,648 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:55:10,651 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:55:10,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:55:10,652 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:10,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:55:10,653 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:55:10,653 INFO L87 Difference]: Start difference. First operand 141 states and 148 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:55:11,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:11,168 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2022-02-20 23:55:11,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:55:11,168 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:55:11,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:11,168 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:55:11,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2022-02-20 23:55:11,170 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:55:11,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2022-02-20 23:55:11,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 148 transitions. [2022-02-20 23:55:11,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:11,338 INFO L225 Difference]: With dead ends: 138 [2022-02-20 23:55:11,338 INFO L226 Difference]: Without dead ends: 138 [2022-02-20 23:55:11,338 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:55:11,339 INFO L933 BasicCegarLoop]: 95 mSDtfsCounter, 93 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:11,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [93 Valid, 120 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:55:11,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-02-20 23:55:11,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2022-02-20 23:55:11,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:11,344 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 138 states, 75 states have (on average 1.9333333333333333) internal successors, (145), 137 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:11,344 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 138 states, 75 states have (on average 1.9333333333333333) internal successors, (145), 137 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:11,344 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 138 states, 75 states have (on average 1.9333333333333333) internal successors, (145), 137 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:11,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:11,347 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2022-02-20 23:55:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2022-02-20 23:55:11,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:11,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:11,349 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 75 states have (on average 1.9333333333333333) internal successors, (145), 137 states have internal predecessors, (145), 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 138 states. [2022-02-20 23:55:11,349 INFO L87 Difference]: Start difference. First operand has 138 states, 75 states have (on average 1.9333333333333333) internal successors, (145), 137 states have internal predecessors, (145), 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 138 states. [2022-02-20 23:55:11,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:11,352 INFO L93 Difference]: Finished difference Result 138 states and 145 transitions. [2022-02-20 23:55:11,352 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2022-02-20 23:55:11,353 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:11,353 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:11,353 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:11,353 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:11,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 75 states have (on average 1.9333333333333333) internal successors, (145), 137 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:11,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 145 transitions. [2022-02-20 23:55:11,356 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 145 transitions. Word has length 3 [2022-02-20 23:55:11,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:11,357 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 145 transitions. [2022-02-20 23:55:11,357 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:55:11,357 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 145 transitions. [2022-02-20 23:55:11,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:55:11,357 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:11,357 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:11,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:55:11,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:11,564 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:55:11,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:11,564 INFO L85 PathProgramCache]: Analyzing trace with hash 59261803, now seen corresponding path program 1 times [2022-02-20 23:55:11,564 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:11,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1754803462] [2022-02-20 23:55:11,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:11,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:11,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:11,566 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:11,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:55:11,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:11,617 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:55:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:11,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:11,632 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:55:11,682 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:55:11,682 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-02-20 23:55:11,717 INFO L290 TraceCheckUtils]: 0: Hoare triple {1289#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {1289#true} is VALID [2022-02-20 23:55:11,718 INFO L290 TraceCheckUtils]: 1: Hoare triple {1289#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);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; {1297#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:11,719 INFO L290 TraceCheckUtils]: 2: Hoare triple {1297#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L997 {1297#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:11,719 INFO L290 TraceCheckUtils]: 3: Hoare triple {1297#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {1297#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:11,720 INFO L290 TraceCheckUtils]: 4: Hoare triple {1297#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(8bv32, main_~head~0#1.offset), 4bv32); srcloc: L998 {1297#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:11,720 INFO L290 TraceCheckUtils]: 5: Hoare triple {1297#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {1310#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:11,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {1310#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} assume !!(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {1310#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:11,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {1310#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~x~0#1.base]); {1290#false} is VALID [2022-02-20 23:55:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:11,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:11,722 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:11,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1754803462] [2022-02-20 23:55:11,722 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1754803462] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:11,722 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:11,722 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:55:11,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140703346] [2022-02-20 23:55:11,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:11,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-02-20 23:55:11,723 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:11,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:11,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:11,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:55:11,733 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:11,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:55:11,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:55:11,733 INFO L87 Difference]: Start difference. First operand 138 states and 145 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:12,350 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2022-02-20 23:55:12,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:55:12,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-02-20 23:55:12,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:12,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2022-02-20 23:55:12,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 157 transitions. [2022-02-20 23:55:12,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 157 transitions. [2022-02-20 23:55:12,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:12,505 INFO L225 Difference]: With dead ends: 129 [2022-02-20 23:55:12,505 INFO L226 Difference]: Without dead ends: 129 [2022-02-20 23:55:12,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:55:12,506 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 161 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:12,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 86 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:55:12,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-02-20 23:55:12,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 125. [2022-02-20 23:55:12,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:12,509 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 125 states, 79 states have (on average 1.7215189873417722) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,509 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 125 states, 79 states have (on average 1.7215189873417722) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,510 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 125 states, 79 states have (on average 1.7215189873417722) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:12,512 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2022-02-20 23:55:12,512 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2022-02-20 23:55:12,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:12,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:12,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 79 states have (on average 1.7215189873417722) internal successors, (136), 124 states have internal predecessors, (136), 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 129 states. [2022-02-20 23:55:12,513 INFO L87 Difference]: Start difference. First operand has 125 states, 79 states have (on average 1.7215189873417722) internal successors, (136), 124 states have internal predecessors, (136), 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 129 states. [2022-02-20 23:55:12,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:12,515 INFO L93 Difference]: Finished difference Result 129 states and 137 transitions. [2022-02-20 23:55:12,515 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2022-02-20 23:55:12,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:12,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:12,516 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:12,516 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:12,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 79 states have (on average 1.7215189873417722) internal successors, (136), 124 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 136 transitions. [2022-02-20 23:55:12,518 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 136 transitions. Word has length 8 [2022-02-20 23:55:12,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:12,519 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 136 transitions. [2022-02-20 23:55:12,519 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,519 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 136 transitions. [2022-02-20 23:55:12,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:55:12,519 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:12,519 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:12,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 23:55:12,725 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:12,728 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:55:12,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:12,728 INFO L85 PathProgramCache]: Analyzing trace with hash 59261804, now seen corresponding path program 1 times [2022-02-20 23:55:12,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:12,729 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [851321103] [2022-02-20 23:55:12,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:12,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:12,729 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:12,730 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:12,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:55:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:12,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:55:12,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:12,805 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:12,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:55:12,911 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:55:12,911 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:55:12,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {1830#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {1830#true} is VALID [2022-02-20 23:55:12,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {1830#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);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; {1838#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:12,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {1838#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L997 {1838#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:12,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {1838#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {1838#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:12,925 INFO L290 TraceCheckUtils]: 4: Hoare triple {1838#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(8bv32, main_~head~0#1.offset), 4bv32); srcloc: L998 {1838#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:55:12,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {1838#(and (= (select |#length| |ULTIMATE.start_main_~head~0#1.base|) (_ bv12 32)) (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {1851#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:12,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {1851#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} assume !!(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {1851#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:12,928 INFO L290 TraceCheckUtils]: 7: Hoare triple {1851#(and (= (select |#length| |ULTIMATE.start_main_~x~0#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_~x~0#1.offset), #length[main_~x~0#1.base]) && ~bvule32(main_~x~0#1.offset, ~bvadd32(4bv32, main_~x~0#1.offset))) && ~bvule32(0bv32, main_~x~0#1.offset)); {1831#false} is VALID [2022-02-20 23:55:12,928 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:12,928 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:12,929 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:12,929 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [851321103] [2022-02-20 23:55:12,929 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [851321103] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:12,929 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:12,929 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:55:12,929 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246315104] [2022-02-20 23:55:12,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:12,930 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-02-20 23:55:12,930 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:12,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:12,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:12,940 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:55:12,940 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:12,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:55:12,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:55:12,942 INFO L87 Difference]: Start difference. First operand 125 states and 136 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:13,831 INFO L93 Difference]: Finished difference Result 170 states and 182 transitions. [2022-02-20 23:55:13,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:55:13,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-02-20 23:55:13,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:13,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2022-02-20 23:55:13,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:13,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2022-02-20 23:55:13,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 194 transitions. [2022-02-20 23:55:14,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:14,035 INFO L225 Difference]: With dead ends: 170 [2022-02-20 23:55:14,035 INFO L226 Difference]: Without dead ends: 170 [2022-02-20 23:55:14,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:55:14,036 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 165 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:14,036 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 129 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:55:14,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-02-20 23:55:14,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 151. [2022-02-20 23:55:14,046 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:14,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 151 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 150 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:14,046 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 151 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 150 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:14,046 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 151 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 150 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:14,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:14,049 INFO L93 Difference]: Finished difference Result 170 states and 182 transitions. [2022-02-20 23:55:14,049 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 182 transitions. [2022-02-20 23:55:14,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:14,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:14,050 INFO L74 IsIncluded]: Start isIncluded. First operand has 151 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 150 states have internal predecessors, (169), 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 170 states. [2022-02-20 23:55:14,050 INFO L87 Difference]: Start difference. First operand has 151 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 150 states have internal predecessors, (169), 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 170 states. [2022-02-20 23:55:14,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:14,053 INFO L93 Difference]: Finished difference Result 170 states and 182 transitions. [2022-02-20 23:55:14,053 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 182 transitions. [2022-02-20 23:55:14,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:14,054 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:14,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:14,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:14,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 105 states have (on average 1.6095238095238096) internal successors, (169), 150 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:14,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 169 transitions. [2022-02-20 23:55:14,056 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 169 transitions. Word has length 8 [2022-02-20 23:55:14,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:14,056 INFO L470 AbstractCegarLoop]: Abstraction has 151 states and 169 transitions. [2022-02-20 23:55:14,057 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:14,057 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 169 transitions. [2022-02-20 23:55:14,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:55:14,057 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:14,057 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:14,069 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:55:14,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:14,257 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:55:14,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:14,258 INFO L85 PathProgramCache]: Analyzing trace with hash 236809587, now seen corresponding path program 1 times [2022-02-20 23:55:14,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:14,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242354073] [2022-02-20 23:55:14,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:14,258 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:14,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:14,259 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:14,260 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:55:14,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:14,328 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:55:14,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:14,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:14,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:55:14,372 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:55:14,394 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-20 23:55:14,399 INFO L290 TraceCheckUtils]: 0: Hoare triple {2520#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {2520#true} is VALID [2022-02-20 23:55:14,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {2520#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);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; {2520#true} is VALID [2022-02-20 23:55:14,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {2520#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L997 {2520#true} is VALID [2022-02-20 23:55:14,400 INFO L290 TraceCheckUtils]: 3: Hoare triple {2520#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {2520#true} is VALID [2022-02-20 23:55:14,400 INFO L290 TraceCheckUtils]: 4: Hoare triple {2520#true} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(8bv32, main_~head~0#1.offset), 4bv32); srcloc: L998 {2520#true} is VALID [2022-02-20 23:55:14,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {2520#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {2520#true} is VALID [2022-02-20 23:55:14,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {2520#true} assume !!(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {2543#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:14,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {2543#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1004-2 {2547#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:55:14,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {2547#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {2547#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:55:14,403 INFO L290 TraceCheckUtils]: 9: Hoare triple {2547#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1004-4 {2554#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:55:14,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {2554#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_#t~mem4#1.base]); {2521#false} is VALID [2022-02-20 23:55:14,403 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:14,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:14,404 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:14,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242354073] [2022-02-20 23:55:14,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242354073] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:14,404 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:14,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:55:14,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977836623] [2022-02-20 23:55:14,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:14,405 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:55:14,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:14,405 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:55:14,415 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:55:14,415 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:55:14,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:14,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:55:14,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:55:14,416 INFO L87 Difference]: Start difference. First operand 151 states and 169 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:55:15,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:15,558 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2022-02-20 23:55:15,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:55:15,558 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:55:15,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:15,558 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:55:15,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2022-02-20 23:55:15,560 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:55:15,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 128 transitions. [2022-02-20 23:55:15,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 128 transitions. [2022-02-20 23:55:15,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:15,663 INFO L225 Difference]: With dead ends: 150 [2022-02-20 23:55:15,663 INFO L226 Difference]: Without dead ends: 150 [2022-02-20 23:55:15,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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:55:15,664 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 9 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:15,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 299 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:55:15,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-02-20 23:55:15,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-02-20 23:55:15,667 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:15,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 150 states, 105 states have (on average 1.5904761904761904) internal successors, (167), 149 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:15,668 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 150 states, 105 states have (on average 1.5904761904761904) internal successors, (167), 149 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:15,668 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 150 states, 105 states have (on average 1.5904761904761904) internal successors, (167), 149 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:15,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:15,670 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2022-02-20 23:55:15,670 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2022-02-20 23:55:15,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:15,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:15,670 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 105 states have (on average 1.5904761904761904) internal successors, (167), 149 states have internal predecessors, (167), 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 150 states. [2022-02-20 23:55:15,671 INFO L87 Difference]: Start difference. First operand has 150 states, 105 states have (on average 1.5904761904761904) internal successors, (167), 149 states have internal predecessors, (167), 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 150 states. [2022-02-20 23:55:15,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:15,673 INFO L93 Difference]: Finished difference Result 150 states and 167 transitions. [2022-02-20 23:55:15,673 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2022-02-20 23:55:15,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:15,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:15,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:15,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:15,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 105 states have (on average 1.5904761904761904) internal successors, (167), 149 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:15,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 167 transitions. [2022-02-20 23:55:15,684 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 167 transitions. Word has length 11 [2022-02-20 23:55:15,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:15,684 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 167 transitions. [2022-02-20 23:55:15,684 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:55:15,684 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 167 transitions. [2022-02-20 23:55:15,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:55:15,685 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:15,685 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:15,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:55:15,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:15,893 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:55:15,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:15,894 INFO L85 PathProgramCache]: Analyzing trace with hash 236809588, now seen corresponding path program 1 times [2022-02-20 23:55:15,894 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:15,894 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1281385160] [2022-02-20 23:55:15,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:15,894 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:15,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:15,895 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:15,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:55:15,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:15,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:55:15,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:15,960 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:15,988 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:55:16,017 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:55:16,022 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:55:16,063 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-20 23:55:16,066 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:55:16,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {3161#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {3161#true} is VALID [2022-02-20 23:55:16,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {3161#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);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; {3161#true} is VALID [2022-02-20 23:55:16,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {3161#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L997 {3161#true} is VALID [2022-02-20 23:55:16,078 INFO L290 TraceCheckUtils]: 3: Hoare triple {3161#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {3161#true} is VALID [2022-02-20 23:55:16,078 INFO L290 TraceCheckUtils]: 4: Hoare triple {3161#true} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(8bv32, main_~head~0#1.offset), 4bv32); srcloc: L998 {3161#true} is VALID [2022-02-20 23:55:16,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {3161#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {3161#true} is VALID [2022-02-20 23:55:16,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {3161#true} assume !!(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {3184#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_#t~malloc3#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:16,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {3184#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv12 32)) (= |ULTIMATE.start_main_#t~malloc3#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1004-2 {3188#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:55:16,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {3188#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {3188#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:55:16,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {3188#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv12 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1004-4 {3195#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:55:16,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {3195#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|) (_ bv12 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem4#1.offset)), #length[main_#t~mem4#1.base]) && ~bvule32(~bvadd32(4bv32, main_#t~mem4#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem4#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, main_#t~mem4#1.offset))); {3162#false} is VALID [2022-02-20 23:55:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:16,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:16,082 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:16,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1281385160] [2022-02-20 23:55:16,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1281385160] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:16,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:16,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:55:16,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850747012] [2022-02-20 23:55:16,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:16,083 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:55:16,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:16,084 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:55:16,095 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:55:16,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:55:16,096 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:16,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:55:16,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:55:16,096 INFO L87 Difference]: Start difference. First operand 150 states and 167 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:55:17,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:17,405 INFO L93 Difference]: Finished difference Result 149 states and 165 transitions. [2022-02-20 23:55:17,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:55:17,405 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:55:17,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:17,405 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:55:17,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2022-02-20 23:55:17,406 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:55:17,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 127 transitions. [2022-02-20 23:55:17,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 127 transitions. [2022-02-20 23:55:17,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:17,514 INFO L225 Difference]: With dead ends: 149 [2022-02-20 23:55:17,514 INFO L226 Difference]: Without dead ends: 149 [2022-02-20 23:55:17,514 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 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:55:17,515 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 4 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:17,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 281 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:55:17,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-02-20 23:55:17,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-02-20 23:55:17,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:17,518 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 149 states, 105 states have (on average 1.5714285714285714) internal successors, (165), 148 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:17,518 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 149 states, 105 states have (on average 1.5714285714285714) internal successors, (165), 148 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:17,519 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 149 states, 105 states have (on average 1.5714285714285714) internal successors, (165), 148 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:17,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:17,521 INFO L93 Difference]: Finished difference Result 149 states and 165 transitions. [2022-02-20 23:55:17,521 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 165 transitions. [2022-02-20 23:55:17,521 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:17,521 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:17,522 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 105 states have (on average 1.5714285714285714) internal successors, (165), 148 states have internal predecessors, (165), 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 149 states. [2022-02-20 23:55:17,522 INFO L87 Difference]: Start difference. First operand has 149 states, 105 states have (on average 1.5714285714285714) internal successors, (165), 148 states have internal predecessors, (165), 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 149 states. [2022-02-20 23:55:17,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:17,524 INFO L93 Difference]: Finished difference Result 149 states and 165 transitions. [2022-02-20 23:55:17,524 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 165 transitions. [2022-02-20 23:55:17,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:17,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:17,525 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:17,525 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:17,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 105 states have (on average 1.5714285714285714) internal successors, (165), 148 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:17,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 165 transitions. [2022-02-20 23:55:17,527 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 165 transitions. Word has length 11 [2022-02-20 23:55:17,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:17,528 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 165 transitions. [2022-02-20 23:55:17,528 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:55:17,528 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 165 transitions. [2022-02-20 23:55:17,528 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:55:17,528 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:17,528 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:17,535 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:55:17,735 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:17,735 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:55:17,735 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:17,736 INFO L85 PathProgramCache]: Analyzing trace with hash -1283125910, now seen corresponding path program 1 times [2022-02-20 23:55:17,736 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:17,736 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1676678579] [2022-02-20 23:55:17,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:17,736 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:17,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:17,737 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:17,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:55:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:17,790 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:55:17,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:17,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:17,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {3798#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {3798#true} is VALID [2022-02-20 23:55:17,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {3798#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);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; {3806#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:55:17,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {3806#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L997 {3806#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:55:17,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {3806#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {3806#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:55:17,830 INFO L290 TraceCheckUtils]: 4: Hoare triple {3806#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(8bv32, main_~head~0#1.offset), 4bv32); srcloc: L998 {3806#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:55:17,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {3806#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {3806#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:55:17,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {3806#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {3806#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:55:17,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {3806#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {3825#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:55:17,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {3825#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1008-3 {3825#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:55:17,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {3825#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} assume !((main_#t~mem6#1.base != 0bv32 || main_#t~mem6#1.offset != 0bv32) && 0bv32 != main_#t~nondet7#1);havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1; {3825#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:55:17,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {3825#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} assume !(main_~x~0#1.base != 0bv32 || main_~x~0#1.offset != 0bv32); {3799#false} is VALID [2022-02-20 23:55:17,837 INFO L290 TraceCheckUtils]: 11: Hoare triple {3799#false} assume !false; {3799#false} is VALID [2022-02-20 23:55:17,837 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:17,838 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:17,838 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:17,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1676678579] [2022-02-20 23:55:17,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1676678579] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:17,838 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:17,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:55:17,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502111300] [2022-02-20 23:55:17,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:17,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.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:55:17,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:17,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.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:55:17,857 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:55:17,857 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:55:17,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:17,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:55:17,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:55:17,859 INFO L87 Difference]: Start difference. First operand 149 states and 165 transitions. Second operand has 4 states, 4 states have (on average 3.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:55:18,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:18,441 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2022-02-20 23:55:18,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:55:18,441 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.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:55:18,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:18,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.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:55:18,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2022-02-20 23:55:18,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.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:55:18,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 173 transitions. [2022-02-20 23:55:18,444 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 173 transitions. [2022-02-20 23:55:18,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:18,597 INFO L225 Difference]: With dead ends: 161 [2022-02-20 23:55:18,597 INFO L226 Difference]: Without dead ends: 161 [2022-02-20 23:55:18,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:55:18,598 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 150 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 182 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:18,598 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 182 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:55:18,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-02-20 23:55:18,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 149. [2022-02-20 23:55:18,600 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:18,601 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 149 states, 105 states have (on average 1.542857142857143) internal successors, (162), 148 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,601 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 149 states, 105 states have (on average 1.542857142857143) internal successors, (162), 148 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,601 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 149 states, 105 states have (on average 1.542857142857143) internal successors, (162), 148 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:18,604 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2022-02-20 23:55:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 172 transitions. [2022-02-20 23:55:18,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:18,604 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:18,604 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 105 states have (on average 1.542857142857143) internal successors, (162), 148 states have internal predecessors, (162), 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 161 states. [2022-02-20 23:55:18,605 INFO L87 Difference]: Start difference. First operand has 149 states, 105 states have (on average 1.542857142857143) internal successors, (162), 148 states have internal predecessors, (162), 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 161 states. [2022-02-20 23:55:18,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:18,607 INFO L93 Difference]: Finished difference Result 161 states and 172 transitions. [2022-02-20 23:55:18,607 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 172 transitions. [2022-02-20 23:55:18,607 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:18,607 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:18,607 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:18,607 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:18,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 105 states have (on average 1.542857142857143) internal successors, (162), 148 states have internal predecessors, (162), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:18,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 162 transitions. [2022-02-20 23:55:18,610 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 162 transitions. Word has length 12 [2022-02-20 23:55:18,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:18,610 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 162 transitions. [2022-02-20 23:55:18,610 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.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:55:18,610 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 162 transitions. [2022-02-20 23:55:18,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:55:18,611 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:18,611 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:18,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-02-20 23:55:18,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:18,817 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:55:18,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:18,818 INFO L85 PathProgramCache]: Analyzing trace with hash -356692446, now seen corresponding path program 1 times [2022-02-20 23:55:18,818 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:18,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [697167396] [2022-02-20 23:55:18,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:18,818 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:18,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:18,819 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:18,820 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:55:18,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:18,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:55:18,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:18,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:18,908 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:55:18,914 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:55:18,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:18,944 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:18,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:18,950 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:18,974 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:18,975 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:18,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:55:18,980 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:55:19,031 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:55:19,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:55:19,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {4471#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {4471#true} is VALID [2022-02-20 23:55:19,053 INFO L290 TraceCheckUtils]: 1: Hoare triple {4471#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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);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; {4479#(= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|)} is VALID [2022-02-20 23:55:19,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {4479#(= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|)} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L997 {4483#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:55:19,055 INFO L290 TraceCheckUtils]: 3: Hoare triple {4483#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {4483#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:55:19,057 INFO L290 TraceCheckUtils]: 4: Hoare triple {4483#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(8bv32, main_~head~0#1.offset), 4bv32); srcloc: L998 {4483#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:55:19,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {4483#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {4483#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:55:19,058 INFO L290 TraceCheckUtils]: 6: Hoare triple {4483#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))} assume !(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1; {4483#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:55:19,058 INFO L290 TraceCheckUtils]: 7: Hoare triple {4483#(and (= (_ bv0 32) |ULTIMATE.start_main_~head~0#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) (_ bv0 32)))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {4499#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (_ bv0 32))) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:55:19,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {4499#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) (_ bv0 32)) (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) (_ bv0 32))) (= |ULTIMATE.start_main_~x~0#1.offset| (_ bv0 32)))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1008-3 {4503#(and (= |ULTIMATE.start_main_#t~mem6#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem6#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:55:19,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {4503#(and (= |ULTIMATE.start_main_#t~mem6#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem6#1.base| (_ bv0 32)))} assume !!((main_#t~mem6#1.base != 0bv32 || main_#t~mem6#1.offset != 0bv32) && 0bv32 != main_#t~nondet7#1);havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~nondet7#1; {4472#false} is VALID [2022-02-20 23:55:19,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {4472#false} assume !!(main_~x~0#1.base != 0bv32 || main_~x~0#1.offset != 0bv32); {4472#false} is VALID [2022-02-20 23:55:19,060 INFO L290 TraceCheckUtils]: 11: Hoare triple {4472#false} goto; {4472#false} is VALID [2022-02-20 23:55:19,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {4472#false} 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, 4bv32); srcloc: L1010-5 {4472#false} is VALID [2022-02-20 23:55:19,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {4472#false} 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; {4472#false} is VALID [2022-02-20 23:55:19,060 INFO L290 TraceCheckUtils]: 14: Hoare triple {4472#false} assume !(1bv1 == #valid[main_~x~0#1.base]); {4472#false} is VALID [2022-02-20 23:55:19,060 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:19,060 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:19,061 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:19,061 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [697167396] [2022-02-20 23:55:19,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [697167396] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:19,061 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:19,061 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:55:19,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544100680] [2022-02-20 23:55:19,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:19,062 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2022-02-20 23:55:19,062 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:19,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:19,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:19,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:55:19,078 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:19,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:55:19,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:55:19,078 INFO L87 Difference]: Start difference. First operand 149 states and 162 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:20,270 INFO L93 Difference]: Finished difference Result 166 states and 180 transitions. [2022-02-20 23:55:20,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:55:20,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2022-02-20 23:55:20,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:55:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:20,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2022-02-20 23:55:20,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 148 transitions. [2022-02-20 23:55:20,273 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 148 transitions. [2022-02-20 23:55:20,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:20,409 INFO L225 Difference]: With dead ends: 166 [2022-02-20 23:55:20,409 INFO L226 Difference]: Without dead ends: 166 [2022-02-20 23:55:20,409 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:55:20,410 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 106 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:55:20,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 397 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:55:20,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-02-20 23:55:20,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 152. [2022-02-20 23:55:20,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:55:20,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 152 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 151 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:20,413 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 152 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 151 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:20,413 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 152 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 151 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:20,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:20,416 INFO L93 Difference]: Finished difference Result 166 states and 180 transitions. [2022-02-20 23:55:20,416 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2022-02-20 23:55:20,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:20,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:20,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 151 states have internal predecessors, (165), 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 166 states. [2022-02-20 23:55:20,417 INFO L87 Difference]: Start difference. First operand has 152 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 151 states have internal predecessors, (165), 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 166 states. [2022-02-20 23:55:20,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:55:20,419 INFO L93 Difference]: Finished difference Result 166 states and 180 transitions. [2022-02-20 23:55:20,419 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 180 transitions. [2022-02-20 23:55:20,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:55:20,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:55:20,420 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:55:20,420 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:55:20,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 151 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:20,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 165 transitions. [2022-02-20 23:55:20,422 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 165 transitions. Word has length 15 [2022-02-20 23:55:20,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:55:20,422 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 165 transitions. [2022-02-20 23:55:20,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:20,423 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 165 transitions. [2022-02-20 23:55:20,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:55:20,423 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:55:20,423 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:55:20,431 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-02-20 23:55:20,629 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:55:20,630 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 65 more)] === [2022-02-20 23:55:20,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:55:20,630 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053835, now seen corresponding path program 1 times [2022-02-20 23:55:20,630 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:55:20,631 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1462645750] [2022-02-20 23:55:20,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:55:20,631 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:55:20,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:55:20,632 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:55:20,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:55:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:20,708 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:55:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:55:20,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:55:20,741 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:55:20,741 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-02-20 23:55:20,846 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-02-20 23:55:20,846 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-02-20 23:55:20,942 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:55:21,146 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:55:21,147 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-02-20 23:55:21,232 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-02-20 23:55:21,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {5175#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {5180#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} is VALID [2022-02-20 23:55:21,570 INFO L290 TraceCheckUtils]: 1: Hoare triple {5180#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} 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~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~mem4#1.base, main_#t~mem4#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~nondet2#1, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~nondet7#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~malloc10#1.base, main_#t~malloc10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1, main_#t~mem18#1, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~t1~0#1, main_~t2~0#1, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~prev~0#1.base, main_~prev~0#1.offset;call main_#t~malloc1#1.base, main_#t~malloc1#1.offset := #Ultimate.allocOnHeap(12bv32);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; {5184#(and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} is VALID [2022-02-20 23:55:21,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {5184#(and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L997 {5184#(and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} is VALID [2022-02-20 23:55:21,571 INFO L290 TraceCheckUtils]: 3: Hoare triple {5184#(and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L997-1 {5184#(and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} is VALID [2022-02-20 23:55:21,571 INFO L290 TraceCheckUtils]: 4: Hoare triple {5184#(and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(8bv32, main_~head~0#1.offset), 4bv32); srcloc: L998 {5184#(and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} is VALID [2022-02-20 23:55:21,572 INFO L290 TraceCheckUtils]: 5: Hoare triple {5184#(and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {5197#(and (or (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:55:21,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {5197#(and (or (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} assume !!(0bv32 != main_#t~nondet2#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {5201#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1)) (exists ((v_arrayElimCell_15 (_ BitVec 1))) (and (or (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_15))) (= |ULTIMATE.start_main_#t~malloc3#1.base| (_ bv0 32))) (or (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)) (= (_ bv0 1) v_arrayElimCell_15)))) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc3#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:55:21,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {5201#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1)) (exists ((v_arrayElimCell_15 (_ BitVec 1))) (and (or (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_15))) (= |ULTIMATE.start_main_#t~malloc3#1.base| (_ bv0 32))) (or (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)) (= (_ bv0 1) v_arrayElimCell_15)))) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc3#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1004-2 {5205#(and (exists ((v_arrayElimCell_15 (_ BitVec 1))) (and (or (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)) (= (_ bv0 1) v_arrayElimCell_15)) (or (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_15))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:55:21,583 INFO L290 TraceCheckUtils]: 8: Hoare triple {5205#(and (exists ((v_arrayElimCell_15 (_ BitVec 1))) (and (or (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)) (= (_ bv0 1) v_arrayElimCell_15)) (or (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_15))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {5205#(and (exists ((v_arrayElimCell_15 (_ BitVec 1))) (and (or (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)) (= (_ bv0 1) v_arrayElimCell_15)) (or (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_15))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:55:21,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {5205#(and (exists ((v_arrayElimCell_15 (_ BitVec 1))) (and (or (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)) (= (_ bv0 1) v_arrayElimCell_15)) (or (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_15))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} SUMMARY for call main_#t~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1004-4 {5212#(and (exists ((v_arrayElimCell_15 (_ BitVec 1))) (and (or (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)) (= (_ bv0 1) v_arrayElimCell_15)) (or (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_15))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem4#1.base|) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:55:21,595 INFO L290 TraceCheckUtils]: 10: Hoare triple {5212#(and (exists ((v_arrayElimCell_15 (_ BitVec 1))) (and (or (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)) (= (_ bv0 1) v_arrayElimCell_15)) (or (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_15))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) |ULTIMATE.start_main_#t~mem4#1.base|) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} SUMMARY for call write~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, main_#t~mem4#1.base, ~bvadd32(4bv32, main_#t~mem4#1.offset), 4bv32); srcloc: L1004-5 {5205#(and (exists ((v_arrayElimCell_15 (_ BitVec 1))) (and (or (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)) (= (_ bv0 1) v_arrayElimCell_15)) (or (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_15))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:55:21,598 INFO L290 TraceCheckUtils]: 11: Hoare triple {5205#(and (exists ((v_arrayElimCell_15 (_ BitVec 1))) (and (or (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)) (= (_ bv0 1) v_arrayElimCell_15)) (or (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_15))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {5205#(and (exists ((v_arrayElimCell_15 (_ BitVec 1))) (and (or (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)) (= (_ bv0 1) v_arrayElimCell_15)) (or (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_15))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:55:21,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {5205#(and (exists ((v_arrayElimCell_15 (_ BitVec 1))) (and (or (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)) (= (_ bv0 1) v_arrayElimCell_15)) (or (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_15))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32))))) (not (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1004-7 {5222#(and (= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv1 1)) (exists ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 1))) (and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (or (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_15))) (= |ULTIMATE.start_main_#t~mem5#1.base| (_ bv0 32))) (or (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)) (= (_ bv0 1) v_arrayElimCell_15)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))))} is VALID [2022-02-20 23:55:21,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {5222#(and (= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv1 1)) (exists ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (v_arrayElimCell_15 (_ BitVec 1))) (and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (or (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_15))) (= |ULTIMATE.start_main_#t~mem5#1.base| (_ bv0 32))) (or (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)) (= (_ bv0 1) v_arrayElimCell_15)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))))} main_~x~0#1.base, main_~x~0#1.offset := main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset; {5226#(and (exists ((v_arrayElimCell_15 (_ BitVec 1)) (|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (or (= |v_ULTIMATE.start_main_~x~0#1.base_99| (_ bv0 32)) (= (_ bv0 1) v_arrayElimCell_15)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_99|))) (or (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_15))) (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:55:21,607 INFO L290 TraceCheckUtils]: 14: Hoare triple {5226#(and (exists ((v_arrayElimCell_15 (_ BitVec 1)) (|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (or (= |v_ULTIMATE.start_main_~x~0#1.base_99| (_ bv0 32)) (= (_ bv0 1) v_arrayElimCell_15)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_99|))) (or (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_15))) (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} assume !(1bv1 == #valid[main_~x~0#1.base]); {5176#false} is VALID [2022-02-20 23:55:21,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:55:21,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:55:21,607 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:55:21,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1462645750] [2022-02-20 23:55:21,607 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1462645750] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:55:21,608 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:55:21,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:55:21,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471418945] [2022-02-20 23:55:21,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:55:21,608 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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 15 [2022-02-20 23:55:21,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:55:21,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:55:21,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:55:21,654 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:55:21,654 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:55:21,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:55:21,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:55:21,655 INFO L87 Difference]: Start difference. First operand 152 states and 165 transitions. Second operand has 10 states, 9 states have (on average 1.6666666666666667) internal successors, (15), 9 states have internal predecessors, (15), 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)