./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/forester-heap/dll-sorted-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/forester-heap/dll-sorted-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b55b51cb0b3b4f908f36b1c6f95a18eadc174b8702aa08ef4d6f9775df6bb52 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:36:30,938 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:36:30,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:36:30,958 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:36:30,958 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:36:30,959 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:36:30,960 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:36:30,961 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:36:30,963 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:36:30,963 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:36:30,964 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:36:30,965 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:36:30,965 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:36:30,966 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:36:30,967 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:36:30,968 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:36:30,968 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:36:30,969 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:36:30,970 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:36:30,971 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:36:30,972 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:36:30,973 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:36:30,974 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:36:30,975 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:36:30,976 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:36:30,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:36:30,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:36:30,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:36:30,978 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:36:30,979 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:36:30,979 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:36:30,980 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:36:30,980 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:36:30,981 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:36:30,981 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:36:30,982 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:36:30,982 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:36:30,982 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:36:30,983 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:36:30,983 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:36:30,984 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:36:30,985 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-02-20 23:36:30,998 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:36:30,998 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:36:30,999 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:36:30,999 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:36:30,999 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:36:31,000 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:36:31,000 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:36:31,000 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:36:31,000 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:36:31,001 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:36:31,001 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:36:31,001 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:36:31,001 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:36:31,001 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:36:31,001 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:36:31,001 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:36:31,002 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:36:31,002 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:36:31,002 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:36:31,002 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:36:31,002 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:36:31,002 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:36:31,002 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:36:31,003 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:36:31,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:36:31,003 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:36:31,003 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:36:31,003 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:36:31,003 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:36:31,003 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b55b51cb0b3b4f908f36b1c6f95a18eadc174b8702aa08ef4d6f9775df6bb52 [2022-02-20 23:36:31,198 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:36:31,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:36:31,218 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:36:31,219 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:36:31,221 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:36:31,221 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-sorted-1.i [2022-02-20 23:36:31,265 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e082148/8f009806d8ac432aa9a08040a63bcfd8/FLAGc56a1990f [2022-02-20 23:36:31,666 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:36:31,667 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i [2022-02-20 23:36:31,677 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e082148/8f009806d8ac432aa9a08040a63bcfd8/FLAGc56a1990f [2022-02-20 23:36:31,689 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/08e082148/8f009806d8ac432aa9a08040a63bcfd8 [2022-02-20 23:36:31,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:36:31,692 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:36:31,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:36:31,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:36:31,697 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:36:31,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:31,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c6f7721 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31, skipping insertion in model container [2022-02-20 23:36:31,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:31,705 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:36:31,745 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:36:31,926 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-sorted-1.i[22384,22397] [2022-02-20 23:36:31,929 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-sorted-1.i[22614,22627] [2022-02-20 23:36:31,932 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-sorted-1.i[22989,23002] [2022-02-20 23:36:31,932 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-sorted-1.i[23053,23066] [2022-02-20 23:36:31,933 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-sorted-1.i[23184,23197] [2022-02-20 23:36:31,934 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-sorted-1.i[23248,23261] [2022-02-20 23:36:31,937 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:36:31,944 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:36:31,986 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-sorted-1.i[22384,22397] [2022-02-20 23:36:31,988 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-sorted-1.i[22614,22627] [2022-02-20 23:36:31,990 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-sorted-1.i[22989,23002] [2022-02-20 23:36:31,991 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-sorted-1.i[23053,23066] [2022-02-20 23:36:31,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-sorted-1.i[23184,23197] [2022-02-20 23:36:31,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-sorted-1.i[23248,23261] [2022-02-20 23:36:31,994 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:36:32,014 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:36:32,014 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:32 WrapperNode [2022-02-20 23:36:32,014 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:36:32,015 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:36:32,016 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:36:32,016 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:36:32,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:32" (1/1) ... [2022-02-20 23:36:32,036 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:32" (1/1) ... [2022-02-20 23:36:32,069 INFO L137 Inliner]: procedures = 119, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 197 [2022-02-20 23:36:32,070 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:36:32,071 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:36:32,071 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:36:32,071 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:36:32,076 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:32" (1/1) ... [2022-02-20 23:36:32,076 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:32" (1/1) ... [2022-02-20 23:36:32,080 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:32" (1/1) ... [2022-02-20 23:36:32,080 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:32" (1/1) ... [2022-02-20 23:36:32,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:32" (1/1) ... [2022-02-20 23:36:32,106 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:32" (1/1) ... [2022-02-20 23:36:32,108 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:32" (1/1) ... [2022-02-20 23:36:32,110 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:36:32,110 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:36:32,111 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:36:32,111 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:36:32,115 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:32" (1/1) ... [2022-02-20 23:36:32,127 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:36:32,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:36:32,174 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:36:32,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:36:32,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:36:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:36:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:36:32,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:36:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:36:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:36:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:36:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:36:32,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:36:32,235 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:36:32,356 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:36:32,357 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:36:32,746 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:36:32,751 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:36:32,752 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 23:36:32,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:36:32 BoogieIcfgContainer [2022-02-20 23:36:32,753 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:36:32,754 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:36:32,754 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:36:32,757 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:36:32,757 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:36:31" (1/3) ... [2022-02-20 23:36:32,757 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19729f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:36:32, skipping insertion in model container [2022-02-20 23:36:32,758 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:32" (2/3) ... [2022-02-20 23:36:32,758 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@19729f0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:36:32, skipping insertion in model container [2022-02-20 23:36:32,759 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:36:32" (3/3) ... [2022-02-20 23:36:32,760 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-sorted-1.i [2022-02-20 23:36:32,767 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:36:32,767 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-02-20 23:36:32,804 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:36:32,809 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:36:32,809 INFO L340 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-02-20 23:36:32,824 INFO L276 IsEmpty]: Start isEmpty. Operand has 179 states, 98 states have (on average 2.183673469387755) internal successors, (214), 178 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:32,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:36:32,830 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:32,830 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:36:32,830 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:36:32,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:32,834 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:36:32,840 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:32,840 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25415830] [2022-02-20 23:36:32,840 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:32,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:32,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:32,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {182#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(15, 2); {182#true} is VALID [2022-02-20 23:36:32,947 INFO L290 TraceCheckUtils]: 1: Hoare triple {182#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {184#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:32,948 INFO L290 TraceCheckUtils]: 2: Hoare triple {184#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} assume !(1 == #valid[main_~head~0#1.base]); {183#false} is VALID [2022-02-20 23:36:32,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:32,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:32,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25415830] [2022-02-20 23:36:32,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25415830] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:32,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:32,950 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:36:32,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2103805773] [2022-02-20 23:36:32,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:32,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:36:32,955 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:32,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:32,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:32,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:32,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:32,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:32,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:32,977 INFO L87 Difference]: Start difference. First operand has 179 states, 98 states have (on average 2.183673469387755) internal successors, (214), 178 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:33,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:33,200 INFO L93 Difference]: Finished difference Result 182 states and 193 transitions. [2022-02-20 23:36:33,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:33,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:36:33,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:33,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2022-02-20 23:36:33,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:33,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 221 transitions. [2022-02-20 23:36:33,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 221 transitions. [2022-02-20 23:36:33,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:33,385 INFO L225 Difference]: With dead ends: 182 [2022-02-20 23:36:33,386 INFO L226 Difference]: Without dead ends: 178 [2022-02-20 23:36:33,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:33,389 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 172 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:33,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 118 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:33,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-02-20 23:36:33,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 174. [2022-02-20 23:36:33,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:33,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 174 states, 97 states have (on average 1.907216494845361) internal successors, (185), 173 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:33,415 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 174 states, 97 states have (on average 1.907216494845361) internal successors, (185), 173 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:33,415 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 174 states, 97 states have (on average 1.907216494845361) internal successors, (185), 173 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:33,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:33,421 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2022-02-20 23:36:33,422 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 189 transitions. [2022-02-20 23:36:33,422 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:33,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:33,423 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 97 states have (on average 1.907216494845361) internal successors, (185), 173 states have internal predecessors, (185), 0 states have call successors, (0), 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 178 states. [2022-02-20 23:36:33,424 INFO L87 Difference]: Start difference. First operand has 174 states, 97 states have (on average 1.907216494845361) internal successors, (185), 173 states have internal predecessors, (185), 0 states have call successors, (0), 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 178 states. [2022-02-20 23:36:33,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:33,432 INFO L93 Difference]: Finished difference Result 178 states and 189 transitions. [2022-02-20 23:36:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 189 transitions. [2022-02-20 23:36:33,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:33,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:33,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:33,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:33,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 97 states have (on average 1.907216494845361) internal successors, (185), 173 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:33,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 185 transitions. [2022-02-20 23:36:33,439 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 185 transitions. Word has length 3 [2022-02-20 23:36:33,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:33,440 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 185 transitions. [2022-02-20 23:36:33,440 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:33,440 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 185 transitions. [2022-02-20 23:36:33,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:36:33,440 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:33,440 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:36:33,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:36:33,441 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:36:33,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:33,441 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:36:33,442 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:33,442 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556034686] [2022-02-20 23:36:33,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:33,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:33,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:33,503 INFO L290 TraceCheckUtils]: 0: Hoare triple {899#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(15, 2); {899#true} is VALID [2022-02-20 23:36:33,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {899#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {901#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:36:33,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {901#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} assume !(4 + main_~head~0#1.offset <= #length[main_~head~0#1.base] && 0 <= main_~head~0#1.offset); {900#false} is VALID [2022-02-20 23:36:33,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:33,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:33,509 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556034686] [2022-02-20 23:36:33,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556034686] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:33,510 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:33,510 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:36:33,510 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850810025] [2022-02-20 23:36:33,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:33,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:36:33,513 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:33,513 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:33,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:33,516 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:33,516 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:33,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:33,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:33,517 INFO L87 Difference]: Start difference. First operand 174 states and 185 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:33,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:33,759 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2022-02-20 23:36:33,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:33,760 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:36:33,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:33,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:33,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 23:36:33,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:33,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 23:36:33,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2022-02-20 23:36:33,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:33,968 INFO L225 Difference]: With dead ends: 175 [2022-02-20 23:36:33,983 INFO L226 Difference]: Without dead ends: 175 [2022-02-20 23:36:33,983 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:33,984 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 167 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:33,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 116 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:33,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-02-20 23:36:33,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 171. [2022-02-20 23:36:33,989 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:33,990 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 171 states, 97 states have (on average 1.8762886597938144) internal successors, (182), 170 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:33,990 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 171 states, 97 states have (on average 1.8762886597938144) internal successors, (182), 170 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:33,991 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 171 states, 97 states have (on average 1.8762886597938144) internal successors, (182), 170 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:33,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:33,995 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2022-02-20 23:36:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 186 transitions. [2022-02-20 23:36:33,996 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:33,996 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:33,997 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 97 states have (on average 1.8762886597938144) internal successors, (182), 170 states have internal predecessors, (182), 0 states have call successors, (0), 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 175 states. [2022-02-20 23:36:33,997 INFO L87 Difference]: Start difference. First operand has 171 states, 97 states have (on average 1.8762886597938144) internal successors, (182), 170 states have internal predecessors, (182), 0 states have call successors, (0), 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 175 states. [2022-02-20 23:36:34,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:34,006 INFO L93 Difference]: Finished difference Result 175 states and 186 transitions. [2022-02-20 23:36:34,007 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 186 transitions. [2022-02-20 23:36:34,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:34,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:34,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:34,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:34,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 97 states have (on average 1.8762886597938144) internal successors, (182), 170 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:34,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 182 transitions. [2022-02-20 23:36:34,027 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 182 transitions. Word has length 3 [2022-02-20 23:36:34,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:34,027 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 182 transitions. [2022-02-20 23:36:34,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:34,027 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 182 transitions. [2022-02-20 23:36:34,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:36:34,028 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:34,028 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:34,028 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:36:34,028 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:36:34,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:34,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112042, now seen corresponding path program 1 times [2022-02-20 23:36:34,029 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:34,029 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382192114] [2022-02-20 23:36:34,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:34,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:34,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:34,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {1600#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(15, 2); {1600#true} is VALID [2022-02-20 23:36:34,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {1600#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {1602#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:34,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {1602#(= (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: L998 {1602#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:34,091 INFO L290 TraceCheckUtils]: 3: Hoare triple {1602#(= (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: L998-1 {1602#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:34,091 INFO L290 TraceCheckUtils]: 4: Hoare triple {1602#(= (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: L999 {1602#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:34,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {1602#(= (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;main_~marked~0#1 := 0; {1603#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:34,092 INFO L290 TraceCheckUtils]: 6: Hoare triple {1603#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {1603#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:34,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {1603#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {1603#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:34,093 INFO L290 TraceCheckUtils]: 8: Hoare triple {1603#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {1601#false} is VALID [2022-02-20 23:36:34,093 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:34,094 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:34,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382192114] [2022-02-20 23:36:34,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [382192114] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:34,094 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:34,094 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:36:34,094 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261122478] [2022-02-20 23:36:34,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:34,095 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:36:34,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:34,095 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:36:34,102 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:36:34,102 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:36:34,102 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:34,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:36:34,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:36:34,103 INFO L87 Difference]: Start difference. First operand 171 states and 182 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:36:34,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:34,376 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2022-02-20 23:36:34,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:36:34,376 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:36:34,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:34,377 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:36:34,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2022-02-20 23:36:34,379 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:36:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 216 transitions. [2022-02-20 23:36:34,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 216 transitions. [2022-02-20 23:36:34,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:34,521 INFO L225 Difference]: With dead ends: 178 [2022-02-20 23:36:34,521 INFO L226 Difference]: Without dead ends: 178 [2022-02-20 23:36:34,522 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:34,525 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 294 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:34,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 89 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:34,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2022-02-20 23:36:34,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 167. [2022-02-20 23:36:34,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:34,542 INFO L82 GeneralOperation]: Start isEquivalent. First operand 178 states. Second operand has 167 states, 111 states have (on average 1.7027027027027026) internal successors, (189), 166 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:34,543 INFO L74 IsIncluded]: Start isIncluded. First operand 178 states. Second operand has 167 states, 111 states have (on average 1.7027027027027026) internal successors, (189), 166 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:34,544 INFO L87 Difference]: Start difference. First operand 178 states. Second operand has 167 states, 111 states have (on average 1.7027027027027026) internal successors, (189), 166 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:34,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:34,549 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2022-02-20 23:36:34,550 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 192 transitions. [2022-02-20 23:36:34,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:34,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:34,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 111 states have (on average 1.7027027027027026) internal successors, (189), 166 states have internal predecessors, (189), 0 states have call successors, (0), 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 178 states. [2022-02-20 23:36:34,551 INFO L87 Difference]: Start difference. First operand has 167 states, 111 states have (on average 1.7027027027027026) internal successors, (189), 166 states have internal predecessors, (189), 0 states have call successors, (0), 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 178 states. [2022-02-20 23:36:34,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:34,558 INFO L93 Difference]: Finished difference Result 178 states and 192 transitions. [2022-02-20 23:36:34,558 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 192 transitions. [2022-02-20 23:36:34,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:34,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:34,559 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:34,559 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:34,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 111 states have (on average 1.7027027027027026) internal successors, (189), 166 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:34,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 189 transitions. [2022-02-20 23:36:34,562 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 189 transitions. Word has length 9 [2022-02-20 23:36:34,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:34,562 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 189 transitions. [2022-02-20 23:36:34,562 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:36:34,563 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 189 transitions. [2022-02-20 23:36:34,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:36:34,564 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:34,564 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:34,564 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:36:34,564 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:36:34,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:34,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1837112043, now seen corresponding path program 1 times [2022-02-20 23:36:34,565 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:34,565 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286667284] [2022-02-20 23:36:34,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:34,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:34,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:34,700 INFO L290 TraceCheckUtils]: 0: Hoare triple {2309#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(15, 2); {2309#true} is VALID [2022-02-20 23:36:34,700 INFO L290 TraceCheckUtils]: 1: Hoare triple {2309#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {2311#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:36:34,701 INFO L290 TraceCheckUtils]: 2: Hoare triple {2311#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {2312#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:36:34,702 INFO L290 TraceCheckUtils]: 3: Hoare triple {2312#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {2312#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:36:34,702 INFO L290 TraceCheckUtils]: 4: Hoare triple {2312#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {2312#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} is VALID [2022-02-20 23:36:34,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {2312#(and (<= 12 (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0; {2313#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} is VALID [2022-02-20 23:36:34,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {2313#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {2313#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} is VALID [2022-02-20 23:36:34,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {2313#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1))} assume !!(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {2314#(and (<= 12 (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0))} is VALID [2022-02-20 23:36:34,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {2314#(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); {2310#false} is VALID [2022-02-20 23:36:34,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:34,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:34,706 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [286667284] [2022-02-20 23:36:34,706 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [286667284] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:34,706 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:34,706 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:36:34,706 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1850753566] [2022-02-20 23:36:34,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:34,707 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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:36:34,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:34,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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:36:34,714 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:36:34,715 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:36:34,715 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:34,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:36:34,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:36:34,718 INFO L87 Difference]: Start difference. First operand 167 states and 189 transitions. Second operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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:36:35,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,290 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2022-02-20 23:36:35,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:36:35,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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:36:35,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:35,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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:36:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 296 transitions. [2022-02-20 23:36:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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:36:35,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 296 transitions. [2022-02-20 23:36:35,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 296 transitions. [2022-02-20 23:36:35,529 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:35,532 INFO L225 Difference]: With dead ends: 258 [2022-02-20 23:36:35,532 INFO L226 Difference]: Without dead ends: 258 [2022-02-20 23:36:35,533 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:36:35,538 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 437 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 437 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:35,539 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [437 Valid, 130 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:36:35,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-02-20 23:36:35,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 220. [2022-02-20 23:36:35,553 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:35,554 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 220 states, 164 states have (on average 1.6097560975609757) internal successors, (264), 219 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,554 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 220 states, 164 states have (on average 1.6097560975609757) internal successors, (264), 219 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,555 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 220 states, 164 states have (on average 1.6097560975609757) internal successors, (264), 219 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,559 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2022-02-20 23:36:35,559 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 282 transitions. [2022-02-20 23:36:35,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:35,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:35,560 INFO L74 IsIncluded]: Start isIncluded. First operand has 220 states, 164 states have (on average 1.6097560975609757) internal successors, (264), 219 states have internal predecessors, (264), 0 states have call successors, (0), 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 258 states. [2022-02-20 23:36:35,560 INFO L87 Difference]: Start difference. First operand has 220 states, 164 states have (on average 1.6097560975609757) internal successors, (264), 219 states have internal predecessors, (264), 0 states have call successors, (0), 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 258 states. [2022-02-20 23:36:35,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,565 INFO L93 Difference]: Finished difference Result 258 states and 282 transitions. [2022-02-20 23:36:35,565 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 282 transitions. [2022-02-20 23:36:35,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:35,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:35,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:35,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:35,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 164 states have (on average 1.6097560975609757) internal successors, (264), 219 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 264 transitions. [2022-02-20 23:36:35,570 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 264 transitions. Word has length 9 [2022-02-20 23:36:35,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:35,571 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 264 transitions. [2022-02-20 23:36:35,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.8) internal successors, (9), 6 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:36:35,571 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 264 transitions. [2022-02-20 23:36:35,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:36:35,572 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:35,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:35,572 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:36:35,572 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:36:35,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:35,573 INFO L85 PathProgramCache]: Analyzing trace with hash 233093812, now seen corresponding path program 1 times [2022-02-20 23:36:35,573 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:35,573 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21179184] [2022-02-20 23:36:35,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:35,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:35,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:35,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {3313#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(15, 2); {3313#true} is VALID [2022-02-20 23:36:35,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {3313#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {3313#true} is VALID [2022-02-20 23:36:35,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {3313#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {3313#true} is VALID [2022-02-20 23:36:35,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {3313#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {3313#true} is VALID [2022-02-20 23:36:35,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {3313#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {3313#true} is VALID [2022-02-20 23:36:35,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {3313#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0; {3315#(= |ULTIMATE.start_main_~marked~0#1| 0)} is VALID [2022-02-20 23:36:35,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {3315#(= |ULTIMATE.start_main_~marked~0#1| 0)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {3315#(= |ULTIMATE.start_main_~marked~0#1| 0)} is VALID [2022-02-20 23:36:35,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {3315#(= |ULTIMATE.start_main_~marked~0#1| 0)} assume !(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1; {3314#false} is VALID [2022-02-20 23:36:35,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {3314#false} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {3314#false} is VALID [2022-02-20 23:36:35,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {3314#false} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {3314#false} is VALID [2022-02-20 23:36:35,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {3314#false} assume !false; {3314#false} is VALID [2022-02-20 23:36:35,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:35,625 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:35,625 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21179184] [2022-02-20 23:36:35,625 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21179184] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:35,625 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:35,626 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:36:35,626 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921926770] [2022-02-20 23:36:35,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:35,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:36:35,626 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:35,626 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:35,633 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:35,634 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:35,634 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:35,634 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:35,634 INFO L87 Difference]: Start difference. First operand 220 states and 264 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,763 INFO L93 Difference]: Finished difference Result 266 states and 313 transitions. [2022-02-20 23:36:35,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:35,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:36:35,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:35,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2022-02-20 23:36:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 208 transitions. [2022-02-20 23:36:35,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 208 transitions. [2022-02-20 23:36:35,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:35,895 INFO L225 Difference]: With dead ends: 266 [2022-02-20 23:36:35,895 INFO L226 Difference]: Without dead ends: 266 [2022-02-20 23:36:35,896 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:35,896 INFO L933 BasicCegarLoop]: 168 mSDtfsCounter, 120 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:35,896 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 235 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:36:35,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2022-02-20 23:36:35,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 233. [2022-02-20 23:36:35,900 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:35,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 266 states. Second operand has 233 states, 177 states have (on average 1.6045197740112995) internal successors, (284), 232 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,901 INFO L74 IsIncluded]: Start isIncluded. First operand 266 states. Second operand has 233 states, 177 states have (on average 1.6045197740112995) internal successors, (284), 232 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,902 INFO L87 Difference]: Start difference. First operand 266 states. Second operand has 233 states, 177 states have (on average 1.6045197740112995) internal successors, (284), 232 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,906 INFO L93 Difference]: Finished difference Result 266 states and 313 transitions. [2022-02-20 23:36:35,906 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 313 transitions. [2022-02-20 23:36:35,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:35,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:35,907 INFO L74 IsIncluded]: Start isIncluded. First operand has 233 states, 177 states have (on average 1.6045197740112995) internal successors, (284), 232 states have internal predecessors, (284), 0 states have call successors, (0), 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 266 states. [2022-02-20 23:36:35,907 INFO L87 Difference]: Start difference. First operand has 233 states, 177 states have (on average 1.6045197740112995) internal successors, (284), 232 states have internal predecessors, (284), 0 states have call successors, (0), 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 266 states. [2022-02-20 23:36:35,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,912 INFO L93 Difference]: Finished difference Result 266 states and 313 transitions. [2022-02-20 23:36:35,912 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 313 transitions. [2022-02-20 23:36:35,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:35,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:35,913 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:35,913 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:35,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 233 states, 177 states have (on average 1.6045197740112995) internal successors, (284), 232 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 284 transitions. [2022-02-20 23:36:35,917 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 284 transitions. Word has length 11 [2022-02-20 23:36:35,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:35,918 INFO L470 AbstractCegarLoop]: Abstraction has 233 states and 284 transitions. [2022-02-20 23:36:35,918 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:35,918 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 284 transitions. [2022-02-20 23:36:35,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:36:35,918 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:35,918 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:35,918 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:36:35,919 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:36:35,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:35,919 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413642, now seen corresponding path program 1 times [2022-02-20 23:36:35,919 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:35,919 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036931008] [2022-02-20 23:36:35,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:35,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:35,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:35,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {4349#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(15, 2); {4349#true} is VALID [2022-02-20 23:36:35,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {4349#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {4349#true} is VALID [2022-02-20 23:36:35,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {4349#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {4349#true} is VALID [2022-02-20 23:36:35,980 INFO L290 TraceCheckUtils]: 3: Hoare triple {4349#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {4349#true} is VALID [2022-02-20 23:36:35,980 INFO L290 TraceCheckUtils]: 4: Hoare triple {4349#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {4349#true} is VALID [2022-02-20 23:36:35,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {4349#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0; {4349#true} is VALID [2022-02-20 23:36:35,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {4349#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {4349#true} is VALID [2022-02-20 23:36:35,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {4349#true} assume !!(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {4351#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|)))} is VALID [2022-02-20 23:36:35,982 INFO L290 TraceCheckUtils]: 8: Hoare triple {4351#(and (= |ULTIMATE.start_main_#t~malloc3#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1009 {4352#(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:36:35,982 INFO L290 TraceCheckUtils]: 9: Hoare triple {4352#(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))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {4352#(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:36:35,983 INFO L290 TraceCheckUtils]: 10: Hoare triple {4352#(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~mem4#1.base, main_#t~mem4#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1010 {4353#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)))} is VALID [2022-02-20 23:36:35,984 INFO L290 TraceCheckUtils]: 11: Hoare triple {4353#(and (= |ULTIMATE.start_main_#t~mem4#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem4#1.base|)))} assume !(4 + (4 + main_#t~mem4#1.offset) <= #length[main_#t~mem4#1.base] && 0 <= 4 + main_#t~mem4#1.offset); {4350#false} is VALID [2022-02-20 23:36:35,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:35,984 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:35,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036931008] [2022-02-20 23:36:35,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036931008] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:35,984 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:35,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:35,984 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226581578] [2022-02-20 23:36:35,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:35,985 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:36:35,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:35,985 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:36:35,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:35,993 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:36:35,993 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:35,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:36:35,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:35,994 INFO L87 Difference]: Start difference. First operand 233 states and 284 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:36:36,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:36,516 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2022-02-20 23:36:36,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:36:36,516 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:36:36,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:36,516 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:36:36,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2022-02-20 23:36:36,517 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:36:36,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 164 transitions. [2022-02-20 23:36:36,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 164 transitions. [2022-02-20 23:36:36,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:36,605 INFO L225 Difference]: With dead ends: 232 [2022-02-20 23:36:36,605 INFO L226 Difference]: Without dead ends: 232 [2022-02-20 23:36:36,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:36:36,606 INFO L933 BasicCegarLoop]: 157 mSDtfsCounter, 6 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:36,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 406 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:36:36,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-02-20 23:36:36,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 232. [2022-02-20 23:36:36,610 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:36,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 232 states, 177 states have (on average 1.5875706214689265) internal successors, (281), 231 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,611 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 232 states, 177 states have (on average 1.5875706214689265) internal successors, (281), 231 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,612 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 232 states, 177 states have (on average 1.5875706214689265) internal successors, (281), 231 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:36,615 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2022-02-20 23:36:36,615 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 281 transitions. [2022-02-20 23:36:36,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:36,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:36,615 INFO L74 IsIncluded]: Start isIncluded. First operand has 232 states, 177 states have (on average 1.5875706214689265) internal successors, (281), 231 states have internal predecessors, (281), 0 states have call successors, (0), 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:36:36,616 INFO L87 Difference]: Start difference. First operand has 232 states, 177 states have (on average 1.5875706214689265) internal successors, (281), 231 states have internal predecessors, (281), 0 states have call successors, (0), 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:36:36,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:36,619 INFO L93 Difference]: Finished difference Result 232 states and 281 transitions. [2022-02-20 23:36:36,619 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 281 transitions. [2022-02-20 23:36:36,620 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:36,620 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:36,620 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:36,620 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:36,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 177 states have (on average 1.5875706214689265) internal successors, (281), 231 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 281 transitions. [2022-02-20 23:36:36,624 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 281 transitions. Word has length 12 [2022-02-20 23:36:36,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:36,624 INFO L470 AbstractCegarLoop]: Abstraction has 232 states and 281 transitions. [2022-02-20 23:36:36,625 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:36:36,625 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 281 transitions. [2022-02-20 23:36:36,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:36:36,625 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:36,625 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:36,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:36:36,625 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:36:36,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:36,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1363413643, now seen corresponding path program 1 times [2022-02-20 23:36:36,626 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:36,626 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749413036] [2022-02-20 23:36:36,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:36,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:36,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:36,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {5288#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(15, 2); {5288#true} is VALID [2022-02-20 23:36:36,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {5288#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {5288#true} is VALID [2022-02-20 23:36:36,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {5288#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {5288#true} is VALID [2022-02-20 23:36:36,680 INFO L290 TraceCheckUtils]: 3: Hoare triple {5288#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, 4 + main_~head~0#1.offset, 4); srcloc: L998-1 {5288#true} is VALID [2022-02-20 23:36:36,680 INFO L290 TraceCheckUtils]: 4: Hoare triple {5288#true} SUMMARY for call write~int(0, main_~head~0#1.base, 8 + main_~head~0#1.offset, 4); srcloc: L999 {5288#true} is VALID [2022-02-20 23:36:36,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {5288#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0; {5288#true} is VALID [2022-02-20 23:36:36,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {5288#true} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {5288#true} is VALID [2022-02-20 23:36:36,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {5288#true} assume !!(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {5290#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) 1)} is VALID [2022-02-20 23:36:36,681 INFO L290 TraceCheckUtils]: 8: Hoare triple {5290#(= (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: L1009 {5291#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:36,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {5291#(= (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; {5291#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:36,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {5291#(= (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: L1010 {5292#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} is VALID [2022-02-20 23:36:36,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {5292#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) 1)} assume !(1 == #valid[main_#t~mem4#1.base]); {5289#false} is VALID [2022-02-20 23:36:36,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:36,683 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:36,683 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749413036] [2022-02-20 23:36:36,683 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749413036] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:36,683 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:36,683 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:36,683 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454807303] [2022-02-20 23:36:36,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:36,684 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:36:36,684 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:36,684 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:36:36,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:36,703 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:36:36,703 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:36,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:36:36,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:36,703 INFO L87 Difference]: Start difference. First operand 232 states and 281 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:36:37,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:37,188 INFO L93 Difference]: Finished difference Result 231 states and 278 transitions. [2022-02-20 23:36:37,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:36:37,188 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:36:37,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:37,189 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:36:37,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2022-02-20 23:36:37,190 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:36:37,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 163 transitions. [2022-02-20 23:36:37,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 163 transitions. [2022-02-20 23:36:37,295 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:37,298 INFO L225 Difference]: With dead ends: 231 [2022-02-20 23:36:37,298 INFO L226 Difference]: Without dead ends: 231 [2022-02-20 23:36:37,298 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:36:37,298 INFO L933 BasicCegarLoop]: 156 mSDtfsCounter, 7 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:37,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 426 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-02-20 23:36:37,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2022-02-20 23:36:37,301 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:37,302 INFO L82 GeneralOperation]: Start isEquivalent. First operand 231 states. Second operand has 231 states, 177 states have (on average 1.5706214689265536) internal successors, (278), 230 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:37,302 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand has 231 states, 177 states have (on average 1.5706214689265536) internal successors, (278), 230 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:37,303 INFO L87 Difference]: Start difference. First operand 231 states. Second operand has 231 states, 177 states have (on average 1.5706214689265536) internal successors, (278), 230 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:37,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:37,306 INFO L93 Difference]: Finished difference Result 231 states and 278 transitions. [2022-02-20 23:36:37,306 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 278 transitions. [2022-02-20 23:36:37,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:37,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:37,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 231 states, 177 states have (on average 1.5706214689265536) internal successors, (278), 230 states have internal predecessors, (278), 0 states have call successors, (0), 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 231 states. [2022-02-20 23:36:37,307 INFO L87 Difference]: Start difference. First operand has 231 states, 177 states have (on average 1.5706214689265536) internal successors, (278), 230 states have internal predecessors, (278), 0 states have call successors, (0), 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 231 states. [2022-02-20 23:36:37,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:37,311 INFO L93 Difference]: Finished difference Result 231 states and 278 transitions. [2022-02-20 23:36:37,311 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 278 transitions. [2022-02-20 23:36:37,311 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:37,311 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:37,311 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:37,311 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:37,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 231 states, 177 states have (on average 1.5706214689265536) internal successors, (278), 230 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:37,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 278 transitions. [2022-02-20 23:36:37,315 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 278 transitions. Word has length 12 [2022-02-20 23:36:37,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:37,315 INFO L470 AbstractCegarLoop]: Abstraction has 231 states and 278 transitions. [2022-02-20 23:36:37,315 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:36:37,315 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 278 transitions. [2022-02-20 23:36:37,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:36:37,316 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:37,316 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:37,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:36:37,316 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:36:37,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:37,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362871, now seen corresponding path program 1 times [2022-02-20 23:36:37,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:37,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466583137] [2022-02-20 23:36:37,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:37,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:37,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:37,402 INFO L290 TraceCheckUtils]: 0: Hoare triple {6223#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(15, 2); {6223#true} is VALID [2022-02-20 23:36:37,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {6223#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {6223#true} is VALID [2022-02-20 23:36:37,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {6223#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {6225#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:37,404 INFO L290 TraceCheckUtils]: 3: Hoare triple {6225#(= (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: L998-1 {6225#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:37,404 INFO L290 TraceCheckUtils]: 4: Hoare triple {6225#(= (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: L999 {6225#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:37,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {6225#(= (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;main_~marked~0#1 := 0; {6226#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:37,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {6226#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {6226#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:37,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {6226#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {6227#(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:36:37,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {6227#(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: L1009 {6228#(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:36:37,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {6228#(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; {6228#(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:36:37,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {6228#(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: L1010 {6229#(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:36:37,408 INFO L290 TraceCheckUtils]: 11: Hoare triple {6229#(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: L1010-1 {6230#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:37,408 INFO L290 TraceCheckUtils]: 12: Hoare triple {6230#(= (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; {6230#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:37,409 INFO L290 TraceCheckUtils]: 13: Hoare triple {6230#(= (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: L1011 {6231#(= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) 1)} is VALID [2022-02-20 23:36:37,409 INFO L290 TraceCheckUtils]: 14: Hoare triple {6231#(= (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; {6226#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:37,410 INFO L290 TraceCheckUtils]: 15: Hoare triple {6226#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !(1 == #valid[main_~x~0#1.base]); {6224#false} is VALID [2022-02-20 23:36:37,410 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:37,410 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:37,410 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466583137] [2022-02-20 23:36:37,410 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466583137] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:37,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:37,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:36:37,411 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845893694] [2022-02-20 23:36:37,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:37,411 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:36:37,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:37,411 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:36:37,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:37,422 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:36:37,422 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:37,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:36:37,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:36:37,423 INFO L87 Difference]: Start difference. First operand 231 states and 278 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:36:38,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:38,160 INFO L93 Difference]: Finished difference Result 237 states and 279 transitions. [2022-02-20 23:36:38,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:36:38,160 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:36:38,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:38,160 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:36:38,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2022-02-20 23:36:38,161 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:36:38,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 186 transitions. [2022-02-20 23:36:38,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 186 transitions. [2022-02-20 23:36:38,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:38,289 INFO L225 Difference]: With dead ends: 237 [2022-02-20 23:36:38,289 INFO L226 Difference]: Without dead ends: 237 [2022-02-20 23:36:38,289 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:36:38,290 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 291 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:38,290 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [291 Valid, 289 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:36:38,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2022-02-20 23:36:38,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 230. [2022-02-20 23:36:38,292 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:38,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 237 states. Second operand has 230 states, 177 states have (on average 1.5593220338983051) internal successors, (276), 229 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:38,293 INFO L74 IsIncluded]: Start isIncluded. First operand 237 states. Second operand has 230 states, 177 states have (on average 1.5593220338983051) internal successors, (276), 229 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:38,294 INFO L87 Difference]: Start difference. First operand 237 states. Second operand has 230 states, 177 states have (on average 1.5593220338983051) internal successors, (276), 229 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:38,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:38,296 INFO L93 Difference]: Finished difference Result 237 states and 279 transitions. [2022-02-20 23:36:38,297 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 279 transitions. [2022-02-20 23:36:38,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:38,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:38,297 INFO L74 IsIncluded]: Start isIncluded. First operand has 230 states, 177 states have (on average 1.5593220338983051) internal successors, (276), 229 states have internal predecessors, (276), 0 states have call successors, (0), 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 237 states. [2022-02-20 23:36:38,298 INFO L87 Difference]: Start difference. First operand has 230 states, 177 states have (on average 1.5593220338983051) internal successors, (276), 229 states have internal predecessors, (276), 0 states have call successors, (0), 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 237 states. [2022-02-20 23:36:38,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:38,301 INFO L93 Difference]: Finished difference Result 237 states and 279 transitions. [2022-02-20 23:36:38,301 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 279 transitions. [2022-02-20 23:36:38,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:38,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:38,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:38,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:38,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 177 states have (on average 1.5593220338983051) internal successors, (276), 229 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:38,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 276 transitions. [2022-02-20 23:36:38,305 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 276 transitions. Word has length 16 [2022-02-20 23:36:38,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:38,305 INFO L470 AbstractCegarLoop]: Abstraction has 230 states and 276 transitions. [2022-02-20 23:36:38,306 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:36:38,306 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 276 transitions. [2022-02-20 23:36:38,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:36:38,306 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:38,306 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:38,306 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:36:38,306 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:36:38,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:38,307 INFO L85 PathProgramCache]: Analyzing trace with hash 1546362872, now seen corresponding path program 1 times [2022-02-20 23:36:38,307 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:38,307 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164740308] [2022-02-20 23:36:38,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:38,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:38,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:38,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {7187#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(15, 2); {7187#true} is VALID [2022-02-20 23:36:38,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {7187#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {7187#true} is VALID [2022-02-20 23:36:38,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {7187#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {7189#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:38,432 INFO L290 TraceCheckUtils]: 3: Hoare triple {7189#(= (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: L998-1 {7189#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:38,432 INFO L290 TraceCheckUtils]: 4: Hoare triple {7189#(= (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: L999 {7189#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:38,433 INFO L290 TraceCheckUtils]: 5: Hoare triple {7189#(= (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;main_~marked~0#1 := 0; {7190#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:38,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {7190#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {7190#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} is VALID [2022-02-20 23:36:38,434 INFO L290 TraceCheckUtils]: 7: Hoare triple {7190#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) 1)} assume !!(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {7191#(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:36:38,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {7191#(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: L1009 {7192#(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:36:38,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {7192#(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; {7192#(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:36:38,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {7192#(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: L1010 {7193#(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:36:38,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {7193#(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: L1010-1 {7194#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:38,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {7194#(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; {7194#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:38,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {7194#(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: L1011 {7195#(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:36:38,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {7195#(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; {7196#(and (= |ULTIMATE.start_main_~x~0#1.offset| 0) (= (+ (- 12) (select |#length| |ULTIMATE.start_main_~x~0#1.base|)) 0))} is VALID [2022-02-20 23:36:38,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {7196#(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); {7188#false} is VALID [2022-02-20 23:36:38,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:38,439 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:38,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164740308] [2022-02-20 23:36:38,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164740308] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:38,439 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:38,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:36:38,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020587899] [2022-02-20 23:36:38,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:38,440 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:36:38,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:38,440 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:36:38,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:38,453 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:36:38,453 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:38,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:36:38,453 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:36:38,454 INFO L87 Difference]: Start difference. First operand 230 states and 276 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:36:39,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:39,544 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2022-02-20 23:36:39,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:36:39,544 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:36:39,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:39,544 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:36:39,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 194 transitions. [2022-02-20 23:36:39,547 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:36:39,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 194 transitions. [2022-02-20 23:36:39,549 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 194 transitions. [2022-02-20 23:36:39,689 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:36:39,692 INFO L225 Difference]: With dead ends: 232 [2022-02-20 23:36:39,692 INFO L226 Difference]: Without dead ends: 232 [2022-02-20 23:36:39,692 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:36:39,692 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 288 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:39,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [288 Valid, 331 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:36:39,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2022-02-20 23:36:39,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 216. [2022-02-20 23:36:39,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:39,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 232 states. Second operand has 216 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 215 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:39,695 INFO L74 IsIncluded]: Start isIncluded. First operand 232 states. Second operand has 216 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 215 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:39,696 INFO L87 Difference]: Start difference. First operand 232 states. Second operand has 216 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 215 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:39,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:39,699 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2022-02-20 23:36:39,699 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 270 transitions. [2022-02-20 23:36:39,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:39,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:39,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 215 states have internal predecessors, (258), 0 states have call successors, (0), 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:36:39,700 INFO L87 Difference]: Start difference. First operand has 216 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 215 states have internal predecessors, (258), 0 states have call successors, (0), 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:36:39,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:39,703 INFO L93 Difference]: Finished difference Result 232 states and 270 transitions. [2022-02-20 23:36:39,703 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 270 transitions. [2022-02-20 23:36:39,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:39,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:39,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:39,703 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:39,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 169 states have (on average 1.5266272189349113) internal successors, (258), 215 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:39,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 258 transitions. [2022-02-20 23:36:39,706 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 258 transitions. Word has length 16 [2022-02-20 23:36:39,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:39,707 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 258 transitions. [2022-02-20 23:36:39,707 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:36:39,707 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 258 transitions. [2022-02-20 23:36:39,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:36:39,707 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:39,707 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] [2022-02-20 23:36:39,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:36:39,708 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:36:39,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:39,708 INFO L85 PathProgramCache]: Analyzing trace with hash -961820477, now seen corresponding path program 1 times [2022-02-20 23:36:39,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:39,708 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954875411] [2022-02-20 23:36:39,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:39,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:39,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:39,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {8137#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(15, 2); {8137#true} is VALID [2022-02-20 23:36:39,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {8137#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {8139#(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: L998 {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,751 INFO L290 TraceCheckUtils]: 3: Hoare triple {8139#(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: L998-1 {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {8139#(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: L999 {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {8139#(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;main_~marked~0#1 := 0; {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,752 INFO L290 TraceCheckUtils]: 6: Hoare triple {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume !!(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 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: L1009 {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,753 INFO L290 TraceCheckUtils]: 9: Hoare triple {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 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: L1010 {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 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: L1010-1 {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,754 INFO L290 TraceCheckUtils]: 13: Hoare triple {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 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: L1011 {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 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; {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1012 {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~marked~0#1 := 1; {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,756 INFO L290 TraceCheckUtils]: 18: Hoare triple {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume 0 != main_~marked~0#1; {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,756 INFO L290 TraceCheckUtils]: 19: Hoare triple {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1020 {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} assume !(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1; {8139#(not (= |ULTIMATE.start_main_~head~0#1.base| 0))} is VALID [2022-02-20 23:36:39,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {8139#(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; {8140#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} is VALID [2022-02-20 23:36:39,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {8140#(not (= |ULTIMATE.start_main_~x~0#1.base| 0))} assume !(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {8138#false} is VALID [2022-02-20 23:36:39,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {8138#false} assume !false; {8138#false} is VALID [2022-02-20 23:36:39,758 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:36:39,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:39,758 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954875411] [2022-02-20 23:36:39,758 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954875411] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:39,759 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:39,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:39,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708037719] [2022-02-20 23:36:39,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:39,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 25 [2022-02-20 23:36:39,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:39,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:39,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:39,774 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:36:39,774 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:39,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:36:39,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:36:39,775 INFO L87 Difference]: Start difference. First operand 216 states and 258 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:40,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:40,084 INFO L93 Difference]: Finished difference Result 253 states and 276 transitions. [2022-02-20 23:36:40,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:36:40,084 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 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 25 [2022-02-20 23:36:40,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:40,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:40,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2022-02-20 23:36:40,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:40,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 257 transitions. [2022-02-20 23:36:40,095 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 257 transitions. [2022-02-20 23:36:40,261 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:40,264 INFO L225 Difference]: With dead ends: 253 [2022-02-20 23:36:40,264 INFO L226 Difference]: Without dead ends: 253 [2022-02-20 23:36:40,264 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:40,265 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 295 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:40,265 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [295 Valid, 202 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:40,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2022-02-20 23:36:40,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 214. [2022-02-20 23:36:40,267 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:40,267 INFO L82 GeneralOperation]: Start isEquivalent. First operand 253 states. Second operand has 214 states, 168 states have (on average 1.5119047619047619) internal successors, (254), 213 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:40,268 INFO L74 IsIncluded]: Start isIncluded. First operand 253 states. Second operand has 214 states, 168 states have (on average 1.5119047619047619) internal successors, (254), 213 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:40,268 INFO L87 Difference]: Start difference. First operand 253 states. Second operand has 214 states, 168 states have (on average 1.5119047619047619) internal successors, (254), 213 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:40,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:40,271 INFO L93 Difference]: Finished difference Result 253 states and 276 transitions. [2022-02-20 23:36:40,271 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 276 transitions. [2022-02-20 23:36:40,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:40,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:40,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 214 states, 168 states have (on average 1.5119047619047619) internal successors, (254), 213 states have internal predecessors, (254), 0 states have call successors, (0), 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 253 states. [2022-02-20 23:36:40,272 INFO L87 Difference]: Start difference. First operand has 214 states, 168 states have (on average 1.5119047619047619) internal successors, (254), 213 states have internal predecessors, (254), 0 states have call successors, (0), 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 253 states. [2022-02-20 23:36:40,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:40,276 INFO L93 Difference]: Finished difference Result 253 states and 276 transitions. [2022-02-20 23:36:40,276 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 276 transitions. [2022-02-20 23:36:40,276 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:40,276 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:40,277 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:40,277 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 168 states have (on average 1.5119047619047619) internal successors, (254), 213 states have internal predecessors, (254), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 254 transitions. [2022-02-20 23:36:40,280 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 254 transitions. Word has length 25 [2022-02-20 23:36:40,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:40,280 INFO L470 AbstractCegarLoop]: Abstraction has 214 states and 254 transitions. [2022-02-20 23:36:40,280 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:40,280 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 254 transitions. [2022-02-20 23:36:40,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:36:40,281 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:40,281 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:36:40,281 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:36:40,281 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:36:40,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:40,281 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912174, now seen corresponding path program 1 times [2022-02-20 23:36:40,281 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:40,282 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831624] [2022-02-20 23:36:40,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:40,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:40,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:40,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {9118#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(15, 2); {9118#true} is VALID [2022-02-20 23:36:40,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {9118#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {9118#true} is VALID [2022-02-20 23:36:40,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {9118#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {9120#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,461 INFO L290 TraceCheckUtils]: 3: Hoare triple {9120#(= (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: L998-1 {9120#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,461 INFO L290 TraceCheckUtils]: 4: Hoare triple {9120#(= (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: L999 {9120#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {9120#(= (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;main_~marked~0#1 := 0; {9121#(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:36:40,463 INFO L290 TraceCheckUtils]: 6: Hoare triple {9121#(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; {9121#(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:36:40,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {9121#(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 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {9122#(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:36:40,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {9122#(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: L1009 {9123#(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:36:40,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {9123#(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; {9123#(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:36:40,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {9123#(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: L1010 {9124#(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|) (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:36:40,472 INFO L290 TraceCheckUtils]: 11: Hoare triple {9124#(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|) (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 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: L1010-1 {9123#(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:36:40,472 INFO L290 TraceCheckUtils]: 12: Hoare triple {9123#(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; {9123#(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:36:40,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {9123#(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: L1011 {9125#(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:36:40,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {9125#(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; {9126#(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:36:40,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {9126#(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: L1012 {9126#(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:36:40,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {9126#(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))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {9126#(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:36:40,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {9126#(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))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~marked~0#1 := 1; {9127#(or (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)) (= |ULTIMATE.start_main_~marked~0#1| 0))} is VALID [2022-02-20 23:36:40,476 INFO L290 TraceCheckUtils]: 18: Hoare triple {9127#(or (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)) (= |ULTIMATE.start_main_~marked~0#1| 0))} assume 0 != main_~marked~0#1; {9126#(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:36:40,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {9126#(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(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1020 {9128#(= (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:36:40,477 INFO L290 TraceCheckUtils]: 20: Hoare triple {9128#(= (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; {9128#(= (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:36:40,477 INFO L290 TraceCheckUtils]: 21: Hoare triple {9128#(= (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 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1; {9128#(= (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:36:40,477 INFO L290 TraceCheckUtils]: 22: Hoare triple {9128#(= (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; {9129#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:40,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {9129#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {9129#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:40,478 INFO L290 TraceCheckUtils]: 24: Hoare triple {9129#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} goto; {9129#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:40,478 INFO L290 TraceCheckUtils]: 25: Hoare triple {9129#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} main_~marked~0#1 := 0; {9129#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:40,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {9129#(= (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~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1030-9 {9129#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:40,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {9129#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} main_#t~short10#1 := main_#t~mem7#1.base != 0 || main_#t~mem7#1.offset != 0; {9129#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:40,479 INFO L290 TraceCheckUtils]: 28: Hoare triple {9129#(= (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~short10#1; {9129#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:40,480 INFO L290 TraceCheckUtils]: 29: Hoare triple {9129#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1030-3 {9130#(= (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|) 1)} is VALID [2022-02-20 23:36:40,480 INFO L290 TraceCheckUtils]: 30: Hoare triple {9130#(= (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|) 1)} assume !(1 == #valid[main_#t~mem8#1.base]); {9119#false} is VALID [2022-02-20 23:36:40,481 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:36:40,481 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:40,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831624] [2022-02-20 23:36:40,481 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831624] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:36:40,481 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122375345] [2022-02-20 23:36:40,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:40,481 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:36:40,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:36:40,495 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:36:40,541 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:36:40,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:40,601 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 35 conjunts are in the unsatisfiable core [2022-02-20 23:36:40,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:40,628 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:36:40,699 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:36:40,835 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:36:40,835 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:36:40,920 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:36:41,055 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:36:41,056 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 19 treesize of output 22 [2022-02-20 23:36:41,189 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:36:41,189 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 22 treesize of output 22 [2022-02-20 23:36:41,343 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:36:41,344 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:36:41,607 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:36:41,609 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:36:41,609 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:36:41,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {9118#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(15, 2); {9118#true} is VALID [2022-02-20 23:36:41,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {9118#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {9137#(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:36:41,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {9137#(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: L998 {9137#(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:36:41,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {9137#(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: L998-1 {9137#(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:36:41,643 INFO L290 TraceCheckUtils]: 4: Hoare triple {9137#(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: L999 {9137#(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:36:41,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {9137#(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;main_~marked~0#1 := 0; {9150#(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:36:41,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {9150#(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; {9150#(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:36:41,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {9150#(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 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {9157#(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_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~head~0#1.offset| 0))} is VALID [2022-02-20 23:36:41,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {9157#(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_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |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: L1009 {9161#(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))} is VALID [2022-02-20 23:36:41,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {9161#(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))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {9161#(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))} is VALID [2022-02-20 23:36:41,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {9161#(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))} 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: L1010 {9168#(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|)))} is VALID [2022-02-20 23:36:41,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {9168#(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|)))} 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: L1010-1 {9161#(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))} is VALID [2022-02-20 23:36:41,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {9161#(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))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {9161#(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))} is VALID [2022-02-20 23:36:41,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {9161#(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))} 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: L1011 {9178#(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))} is VALID [2022-02-20 23:36:41,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {9178#(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))} 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; {9182#(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) (= |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|)))} is VALID [2022-02-20 23:36:41,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {9182#(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) (= |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|)))} SUMMARY for call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1012 {9186#(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_~x~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|)))} is VALID [2022-02-20 23:36:41,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {9186#(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_~x~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|)))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {9186#(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_~x~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|)))} is VALID [2022-02-20 23:36:41,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {9186#(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_~x~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|)))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~marked~0#1 := 1; {9186#(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_~x~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|)))} is VALID [2022-02-20 23:36:41,650 INFO L290 TraceCheckUtils]: 18: Hoare triple {9186#(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_~x~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|)))} assume 0 != main_~marked~0#1; {9186#(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_~x~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|)))} is VALID [2022-02-20 23:36:41,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {9186#(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_~x~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|)))} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1020 {9199#(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| (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:36:41,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {9199#(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| (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; {9199#(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| (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:36:41,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {9199#(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| (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 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1; {9199#(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| (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:36:41,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {9199#(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| (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; {9209#(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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:36:41,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {9209#(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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {9209#(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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:36:41,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {9209#(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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} goto; {9209#(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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:36:41,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {9209#(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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} main_~marked~0#1 := 0; {9209#(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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:36:41,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {9209#(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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1030-9 {9222#(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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:36:41,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {9222#(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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} main_#t~short10#1 := main_#t~mem7#1.base != 0 || main_#t~mem7#1.offset != 0; {9222#(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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:36:41,656 INFO L290 TraceCheckUtils]: 28: Hoare triple {9222#(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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} assume main_#t~short10#1; {9222#(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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} is VALID [2022-02-20 23:36:41,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {9222#(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| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) 0)) 1))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1030-3 {9130#(= (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|) 1)} is VALID [2022-02-20 23:36:41,657 INFO L290 TraceCheckUtils]: 30: Hoare triple {9130#(= (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|) 1)} assume !(1 == #valid[main_#t~mem8#1.base]); {9119#false} is VALID [2022-02-20 23:36:41,658 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:36:41,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:36:42,419 INFO L356 Elim1Store]: treesize reduction 5, result has 66.7 percent of original size [2022-02-20 23:36:42,419 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 19 treesize of output 18 [2022-02-20 23:36:42,475 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) |c_ULTIMATE.start_main_~x~0#1.base|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0))) is different from false [2022-02-20 23:36:42,548 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0) (= |c_ULTIMATE.start_main_#t~mem5#1.base| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)))) is different from false [2022-02-20 23:36:42,644 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0))) is different from false [2022-02-20 23:36:42,805 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_334))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= (select (select (store .cse0 .cse1 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) .cse1))) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0))) is different from false [2022-02-20 23:36:42,881 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |c_ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0) (let ((.cse1 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_334))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|))) (= .cse0 (select (select (store .cse1 .cse0 v_ArrVal_336) |c_ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)))))) is different from false [2022-02-20 23:36:43,029 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:36:43,030 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 51 treesize of output 36 [2022-02-20 23:36:43,063 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:36:43,063 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 170 treesize of output 137 [2022-02-20 23:36:43,093 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 122 treesize of output 114 [2022-02-20 23:36:43,115 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:36:43,116 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 114 treesize of output 102 [2022-02-20 23:36:44,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {9130#(= (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|) 1)} assume !(1 == #valid[main_#t~mem8#1.base]); {9119#false} is VALID [2022-02-20 23:36:44,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {9129#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1030-3 {9130#(= (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|) 1)} is VALID [2022-02-20 23:36:44,342 INFO L290 TraceCheckUtils]: 28: Hoare triple {9129#(= (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~short10#1; {9129#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:44,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {9129#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} main_#t~short10#1 := main_#t~mem7#1.base != 0 || main_#t~mem7#1.offset != 0; {9129#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:44,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {9247#(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~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1030-9 {9129#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 1)} is VALID [2022-02-20 23:36:44,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {9247#(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))} main_~marked~0#1 := 0; {9247#(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:36:44,343 INFO L290 TraceCheckUtils]: 24: Hoare triple {9247#(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))} goto; {9247#(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:36:44,344 INFO L290 TraceCheckUtils]: 23: Hoare triple {9247#(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))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {9247#(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:36:44,344 INFO L290 TraceCheckUtils]: 22: Hoare triple {9260#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {9247#(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:36:44,345 INFO L290 TraceCheckUtils]: 21: Hoare triple {9260#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} assume !(0 != main_#t~nondet2#1 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1; {9260#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} is VALID [2022-02-20 23:36:44,345 INFO L290 TraceCheckUtils]: 20: Hoare triple {9260#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647; {9260#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} is VALID [2022-02-20 23:36:44,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {9270#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} SUMMARY for call write~int(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1020 {9260#(forall ((|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)) 1) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} is VALID [2022-02-20 23:36:44,347 INFO L290 TraceCheckUtils]: 18: Hoare triple {9270#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} assume 0 != main_~marked~0#1; {9270#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} is VALID [2022-02-20 23:36:44,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {9270#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~marked~0#1 := 1; {9270#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} is VALID [2022-02-20 23:36:44,348 INFO L290 TraceCheckUtils]: 16: Hoare triple {9270#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {9270#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} is VALID [2022-02-20 23:36:44,350 WARN L290 TraceCheckUtils]: 15: Hoare triple {9283#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) |ULTIMATE.start_main_~x~0#1.base|) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} SUMMARY for call write~$Pointer$(0, 0, main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1012 {9270#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select |#valid| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)) 1) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} is UNKNOWN [2022-02-20 23:36:44,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {9287#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) |ULTIMATE.start_main_#t~mem5#1.base|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 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; {9283#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base| v_ArrVal_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) |ULTIMATE.start_main_~x~0#1.base|) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} is VALID [2022-02-20 23:36:44,352 INFO L290 TraceCheckUtils]: 13: Hoare triple {9291#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (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_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 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: L1011 {9287#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem5#1.base| v_ArrVal_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) |ULTIMATE.start_main_#t~mem5#1.base|) (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} is VALID [2022-02-20 23:36:44,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {9291#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (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_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {9291#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (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_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} is VALID [2022-02-20 23:36:44,355 INFO L290 TraceCheckUtils]: 11: Hoare triple {9298#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_334) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_334) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_334) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 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: L1010-1 {9291#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (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_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} is VALID [2022-02-20 23:36:44,356 INFO L290 TraceCheckUtils]: 10: Hoare triple {9302#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (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_334) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (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_334) (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_334) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 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: L1010 {9298#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_334) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_334) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_334) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} is VALID [2022-02-20 23:36:44,356 INFO L290 TraceCheckUtils]: 9: Hoare triple {9302#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (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_334) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (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_334) (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_334) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {9302#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (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_334) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (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_334) (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_334) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} is VALID [2022-02-20 23:36:44,357 INFO L290 TraceCheckUtils]: 8: Hoare triple {9309#(and (or (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (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) (= |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: L1009 {9302#(forall ((v_ArrVal_336 (Array Int Int)) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int) (v_ArrVal_334 (Array Int Int))) (or (not (<= |v_ULTIMATE.start_main_~x~0#1.offset_71| |ULTIMATE.start_main_~head~0#1.offset|)) (= (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_334) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (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_334) (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_334) |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_336) |ULTIMATE.start_main_~head~0#1.base|) |v_ULTIMATE.start_main_~x~0#1.offset_71|)) (< |v_ULTIMATE.start_main_~x~0#1.offset_71| 0)))} is VALID [2022-02-20 23:36:44,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {9313#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (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) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (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 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {9309#(and (or (not (= |ULTIMATE.start_main_#t~malloc3#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (< |ULTIMATE.start_main_~head~0#1.offset| 0)) (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) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)))} is VALID [2022-02-20 23:36:44,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {9313#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (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) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (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; {9313#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (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) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (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:36:44,360 INFO L290 TraceCheckUtils]: 5: Hoare triple {9320#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (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_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;main_~marked~0#1 := 0; {9313#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (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) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|)) (or (< |ULTIMATE.start_main_~head~0#1.offset| 0) (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:36:44,361 INFO L290 TraceCheckUtils]: 4: Hoare triple {9320#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (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_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: L999 {9320#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (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_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:36:44,364 INFO L290 TraceCheckUtils]: 3: Hoare triple {9320#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (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_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: L998-1 {9320#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (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_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:36:44,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {9320#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (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_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: L998 {9320#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (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_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:36:44,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {9118#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {9320#(forall ((|v_ULTIMATE.start_main_#t~malloc3#1.base_6| Int)) (or (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_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:36:44,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {9118#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(15, 2); {9118#true} is VALID [2022-02-20 23:36:44,366 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:36:44,366 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [122375345] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:36:44,367 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:36:44,367 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13, 14] total 34 [2022-02-20 23:36:44,367 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722561607] [2022-02-20 23:36:44,367 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:36:44,367 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 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:36:44,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:44,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:44,439 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 85 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:44,439 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-02-20 23:36:44,439 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:44,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-02-20 23:36:44,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=782, Unknown=6, NotChecked=300, Total=1190 [2022-02-20 23:36:44,440 INFO L87 Difference]: Start difference. First operand 214 states and 254 transitions. Second operand has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:48,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:48,282 INFO L93 Difference]: Finished difference Result 505 states and 581 transitions. [2022-02-20 23:36:48,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 23:36:48,282 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 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:36:48,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:48,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:48,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 495 transitions. [2022-02-20 23:36:48,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:48,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 495 transitions. [2022-02-20 23:36:48,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 495 transitions. [2022-02-20 23:36:48,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:48,693 INFO L225 Difference]: With dead ends: 505 [2022-02-20 23:36:48,693 INFO L226 Difference]: Without dead ends: 505 [2022-02-20 23:36:48,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 43 SyntacticMatches, 5 SemanticMatches, 49 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 423 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=354, Invalid=1730, Unknown=6, NotChecked=460, Total=2550 [2022-02-20 23:36:48,694 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 897 mSDsluCounter, 1603 mSDsCounter, 0 mSdLazyCounter, 1713 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 897 SdHoareTripleChecker+Valid, 1691 SdHoareTripleChecker+Invalid, 3514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 1713 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1691 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:48,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [897 Valid, 1691 Invalid, 3514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 1713 Invalid, 0 Unknown, 1691 Unchecked, 1.2s Time] [2022-02-20 23:36:48,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2022-02-20 23:36:48,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 239. [2022-02-20 23:36:48,698 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:48,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 505 states. Second operand has 239 states, 193 states have (on average 1.471502590673575) internal successors, (284), 238 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:48,699 INFO L74 IsIncluded]: Start isIncluded. First operand 505 states. Second operand has 239 states, 193 states have (on average 1.471502590673575) internal successors, (284), 238 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:48,699 INFO L87 Difference]: Start difference. First operand 505 states. Second operand has 239 states, 193 states have (on average 1.471502590673575) internal successors, (284), 238 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:48,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:48,709 INFO L93 Difference]: Finished difference Result 505 states and 581 transitions. [2022-02-20 23:36:48,709 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 581 transitions. [2022-02-20 23:36:48,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:48,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:48,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 239 states, 193 states have (on average 1.471502590673575) internal successors, (284), 238 states have internal predecessors, (284), 0 states have call successors, (0), 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 505 states. [2022-02-20 23:36:48,710 INFO L87 Difference]: Start difference. First operand has 239 states, 193 states have (on average 1.471502590673575) internal successors, (284), 238 states have internal predecessors, (284), 0 states have call successors, (0), 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 505 states. [2022-02-20 23:36:48,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:48,720 INFO L93 Difference]: Finished difference Result 505 states and 581 transitions. [2022-02-20 23:36:48,720 INFO L276 IsEmpty]: Start isEmpty. Operand 505 states and 581 transitions. [2022-02-20 23:36:48,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:48,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:48,721 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:48,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:48,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 193 states have (on average 1.471502590673575) internal successors, (284), 238 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:48,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 284 transitions. [2022-02-20 23:36:48,725 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 284 transitions. Word has length 31 [2022-02-20 23:36:48,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:48,725 INFO L470 AbstractCegarLoop]: Abstraction has 239 states and 284 transitions. [2022-02-20 23:36:48,725 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.5294117647058822) internal successors, (86), 35 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:48,726 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 284 transitions. [2022-02-20 23:36:48,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:36:48,726 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:48,726 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:36:48,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 23:36:48,939 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,SelfDestructingSolverStorable10 [2022-02-20 23:36:48,940 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:36:48,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:48,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1496912173, now seen corresponding path program 1 times [2022-02-20 23:36:48,940 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:48,940 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890295497] [2022-02-20 23:36:48,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:48,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:48,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:49,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {11127#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(15, 2); {11127#true} is VALID [2022-02-20 23:36:49,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {11127#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {11127#true} is VALID [2022-02-20 23:36:49,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {11127#true} SUMMARY for call write~$Pointer$(0, 0, main_~head~0#1.base, main_~head~0#1.offset, 4); srcloc: L998 {11129#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:49,196 INFO L290 TraceCheckUtils]: 3: Hoare triple {11129#(= (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: L998-1 {11129#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:49,196 INFO L290 TraceCheckUtils]: 4: Hoare triple {11129#(= (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: L999 {11129#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1)} is VALID [2022-02-20 23:36:49,197 INFO L290 TraceCheckUtils]: 5: Hoare triple {11129#(= (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;main_~marked~0#1 := 0; {11130#(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:36:49,198 INFO L290 TraceCheckUtils]: 6: Hoare triple {11130#(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; {11130#(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:36:49,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {11130#(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 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {11131#(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:36:49,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {11131#(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: L1009 {11132#(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:36:49,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {11132#(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; {11132#(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:36:49,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {11132#(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: L1010 {11133#(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|) (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:36:49,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {11133#(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|) (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 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: L1010-1 {11132#(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:36:49,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {11132#(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; {11132#(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:36:49,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {11132#(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: L1011 {11134#(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:36:49,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {11134#(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; {11135#(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:36:49,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {11135#(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: L1012 {11135#(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:36:49,216 INFO L290 TraceCheckUtils]: 16: Hoare triple {11135#(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))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {11135#(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:36:49,216 INFO L290 TraceCheckUtils]: 17: Hoare triple {11135#(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))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~marked~0#1 := 1; {11136#(or (= |ULTIMATE.start_main_~marked~0#1| 0) (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:36:49,217 INFO L290 TraceCheckUtils]: 18: Hoare triple {11136#(or (= |ULTIMATE.start_main_~marked~0#1| 0) (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)))} assume 0 != main_~marked~0#1; {11135#(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:36:49,217 INFO L290 TraceCheckUtils]: 19: Hoare triple {11135#(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(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1020 {11137#(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:36:49,218 INFO L290 TraceCheckUtils]: 20: Hoare triple {11137#(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; {11137#(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:36:49,218 INFO L290 TraceCheckUtils]: 21: Hoare triple {11137#(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 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1; {11137#(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:36:49,218 INFO L290 TraceCheckUtils]: 22: Hoare triple {11137#(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; {11138#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:49,219 INFO L290 TraceCheckUtils]: 23: Hoare triple {11138#(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 !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {11138#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:49,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {11138#(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; {11138#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:49,220 INFO L290 TraceCheckUtils]: 25: Hoare triple {11138#(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_~marked~0#1 := 0; {11138#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:49,220 INFO L290 TraceCheckUtils]: 26: Hoare triple {11138#(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~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1030-9 {11138#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:49,220 INFO L290 TraceCheckUtils]: 27: Hoare triple {11138#(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~short10#1 := main_#t~mem7#1.base != 0 || main_#t~mem7#1.offset != 0; {11138#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:49,221 INFO L290 TraceCheckUtils]: 28: Hoare triple {11138#(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~short10#1; {11138#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} is VALID [2022-02-20 23:36:49,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {11138#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|)) 12) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) 0))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1030-3 {11139#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|) (- 12)) 0))} is VALID [2022-02-20 23:36:49,222 INFO L290 TraceCheckUtils]: 30: Hoare triple {11139#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|) (- 12)) 0))} assume !(4 + (8 + main_#t~mem8#1.offset) <= #length[main_#t~mem8#1.base] && 0 <= 8 + main_#t~mem8#1.offset); {11128#false} is VALID [2022-02-20 23:36:49,222 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:36:49,222 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:49,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890295497] [2022-02-20 23:36:49,222 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [890295497] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:36:49,222 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342361232] [2022-02-20 23:36:49,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:49,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:36:49,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:36:49,224 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:36:49,225 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:36:49,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:49,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-20 23:36:49,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:49,322 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:36:49,330 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:36:49,411 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:36:49,420 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:36:49,421 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:36:49,467 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:36:49,478 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:36:49,587 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:36:49,587 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:36:49,593 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:36:49,723 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:36:49,723 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:36:49,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:36:49,732 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 14 treesize of output 16 [2022-02-20 23:36:49,791 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:36:49,791 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:36:49,795 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:36:50,037 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:36:50,038 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:36:50,062 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:36:50,064 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:36:50,064 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:36:50,098 INFO L290 TraceCheckUtils]: 0: Hoare triple {11127#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(15, 2); {11127#true} is VALID [2022-02-20 23:36:50,099 INFO L290 TraceCheckUtils]: 1: Hoare triple {11127#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~short14#1, main_#t~malloc17#1.base, main_#t~malloc17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem21#1, main_#t~short22#1, main_#t~mem26#1, main_#t~mem27#1, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {11146#(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:36:50,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {11146#(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: L998 {11146#(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:36:50,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {11146#(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: L998-1 {11146#(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:36:50,101 INFO L290 TraceCheckUtils]: 4: Hoare triple {11146#(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: L999 {11146#(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:36:50,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {11146#(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;main_~marked~0#1 := 0; {11159#(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:36:50,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {11159#(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; {11159#(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:36:50,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {11159#(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 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12); {11166#(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:36:50,109 INFO L290 TraceCheckUtils]: 8: Hoare triple {11166#(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: L1009 {11170#(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:36:50,112 INFO L290 TraceCheckUtils]: 9: Hoare triple {11170#(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; {11170#(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:36:50,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {11170#(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: L1010 {11177#(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:36:50,115 INFO L290 TraceCheckUtils]: 11: Hoare triple {11177#(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: L1010-1 {11170#(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:36:50,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {11170#(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; {11170#(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:36:50,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {11170#(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: L1011 {11187#(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:36:50,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {11187#(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; {11191#(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:36:50,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {11191#(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: L1012 {11191#(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:36:50,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {11191#(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))} assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647; {11191#(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:36:50,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {11191#(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))} assume 0 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~marked~0#1 := 1; {11191#(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:36:50,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {11191#(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))} assume 0 != main_~marked~0#1; {11191#(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:36:50,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {11191#(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(1, main_~x~0#1.base, 8 + main_~x~0#1.offset, 4); srcloc: L1020 {11207#(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:36:50,124 INFO L290 TraceCheckUtils]: 20: Hoare triple {11207#(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; {11207#(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:36:50,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {11207#(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 || 0 == main_~marked~0#1);havoc main_#t~nondet2#1; {11207#(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:36:50,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {11207#(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; {11217#(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:36:50,126 INFO L290 TraceCheckUtils]: 23: Hoare triple {11217#(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))))} assume !!(0 != main_~x~0#1.base || 0 != main_~x~0#1.offset); {11217#(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:36:50,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {11217#(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))))} goto; {11217#(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:36:50,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {11217#(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))))} main_~marked~0#1 := 0; {11217#(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:36:50,127 INFO L290 TraceCheckUtils]: 26: Hoare triple {11217#(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~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1030-9 {11230#(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:36:50,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {11230#(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~short10#1 := main_#t~mem7#1.base != 0 || main_#t~mem7#1.offset != 0; {11230#(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:36:50,128 INFO L290 TraceCheckUtils]: 28: Hoare triple {11230#(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~short10#1; {11230#(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:36:50,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {11230#(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~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4); srcloc: L1030-3 {11240#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|)))} is VALID [2022-02-20 23:36:50,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {11240#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| 0) (<= 12 (select |#length| |ULTIMATE.start_main_#t~mem8#1.base|)))} assume !(4 + (8 + main_#t~mem8#1.offset) <= #length[main_#t~mem8#1.base] && 0 <= 8 + main_#t~mem8#1.offset); {11128#false} is VALID [2022-02-20 23:36:50,132 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:36:50,132 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:36:52,425 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:36:52,425 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:36:52,439 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:36:52,442 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:36:52,488 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:36:52,489 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:36:52,578 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:36:52,578 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 3027 treesize of output 2898 [2022-02-20 23:36:52,644 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 2867 treesize of output 2739 [2022-02-20 23:36:52,673 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 2739 treesize of output 2675 [2022-02-20 23:36:52,716 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 2675 treesize of output 2547 [2022-02-20 23:36:52,756 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:36:52,756 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 2547 treesize of output 2384 [2022-02-20 23:36:52,790 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 2375 treesize of output 2367 [2022-02-20 23:36:52,828 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 2367 treesize of output 2363 [2022-02-20 23:36:52,879 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 2363 treesize of output 2355 [2022-02-20 23:36:52,931 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 23:36:52,950 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:36:53,148 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,SelfDestructingSolverStorable11 [2022-02-20 23:36:53,148 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:36:53,154 INFO L158 Benchmark]: Toolchain (without parser) took 21461.88ms. Allocated memory was 119.5MB in the beginning and 281.0MB in the end (delta: 161.5MB). Free memory was 77.3MB in the beginning and 229.4MB in the end (delta: -152.1MB). Peak memory consumption was 154.2MB. Max. memory is 16.1GB. [2022-02-20 23:36:53,154 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 119.5MB. Free memory was 94.7MB in the beginning and 94.5MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:36:53,154 INFO L158 Benchmark]: CACSL2BoogieTranslator took 320.16ms. Allocated memory is still 119.5MB. Free memory was 77.2MB in the beginning and 88.8MB in the end (delta: -11.6MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2022-02-20 23:36:53,154 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.00ms. Allocated memory is still 119.5MB. Free memory was 88.8MB in the beginning and 86.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:36:53,156 INFO L158 Benchmark]: Boogie Preprocessor took 39.28ms. Allocated memory is still 119.5MB. Free memory was 86.1MB in the beginning and 83.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:36:53,156 INFO L158 Benchmark]: RCFGBuilder took 642.87ms. Allocated memory is still 119.5MB. Free memory was 83.0MB in the beginning and 63.8MB in the end (delta: 19.2MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2022-02-20 23:36:53,156 INFO L158 Benchmark]: TraceAbstraction took 20398.90ms. Allocated memory was 119.5MB in the beginning and 281.0MB in the end (delta: 161.5MB). Free memory was 63.6MB in the beginning and 229.4MB in the end (delta: -165.9MB). Peak memory consumption was 138.4MB. Max. memory is 16.1GB. [2022-02-20 23:36:53,157 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.16ms. Allocated memory is still 119.5MB. Free memory was 94.7MB in the beginning and 94.5MB in the end (delta: 134.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 320.16ms. Allocated memory is still 119.5MB. Free memory was 77.2MB in the beginning and 88.8MB in the end (delta: -11.6MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.00ms. Allocated memory is still 119.5MB. Free memory was 88.8MB in the beginning and 86.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.28ms. Allocated memory is still 119.5MB. Free memory was 86.1MB in the beginning and 83.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 642.87ms. Allocated memory is still 119.5MB. Free memory was 83.0MB in the beginning and 63.8MB in the end (delta: 19.2MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * TraceAbstraction took 20398.90ms. Allocated memory was 119.5MB in the beginning and 281.0MB in the end (delta: 161.5MB). Free memory was 63.6MB in the beginning and 229.4MB in the end (delta: -165.9MB). Peak memory consumption was 138.4MB. 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:36:53,201 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-sorted-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4b55b51cb0b3b4f908f36b1c6f95a18eadc174b8702aa08ef4d6f9775df6bb52 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:36:54,827 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:36:54,830 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:36:54,868 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:36:54,869 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:36:54,870 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:36:54,871 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:36:54,872 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:36:54,874 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:36:54,877 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:36:54,877 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:36:54,879 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:36:54,879 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:36:54,881 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:36:54,882 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:36:54,886 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:36:54,887 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:36:54,888 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:36:54,890 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:36:54,892 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:36:54,893 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:36:54,894 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:36:54,895 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:36:54,896 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:36:54,901 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:36:54,902 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:36:54,903 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:36:54,903 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:36:54,904 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:36:54,905 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:36:54,905 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:36:54,905 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:36:54,906 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:36:54,907 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:36:54,908 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:36:54,908 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:36:54,908 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:36:54,909 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:36:54,909 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:36:54,910 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:36:54,910 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:36:54,914 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2022-02-20 23:36:54,933 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:36:54,933 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:36:54,934 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:36:54,934 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:36:54,935 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:36:54,935 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:36:54,936 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:36:54,936 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:36:54,936 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:36:54,936 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:36:54,937 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:36:54,937 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:36:54,937 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:36:54,937 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:36:54,937 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:36:54,938 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:36:54,938 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:36:54,938 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:36:54,938 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:36:54,938 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:36:54,938 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:36:54,938 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:36:54,939 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:36:54,939 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:36:54,939 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:36:54,939 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:36:54,939 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:36:54,939 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:36:54,939 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:36:54,940 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:36:54,940 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:36:54,940 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:36:54,940 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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4b55b51cb0b3b4f908f36b1c6f95a18eadc174b8702aa08ef4d6f9775df6bb52 [2022-02-20 23:36:55,210 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:36:55,229 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:36:55,231 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:36:55,232 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:36:55,232 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:36:55,234 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/forester-heap/dll-sorted-1.i [2022-02-20 23:36:55,300 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb6c96d22/119eba53ad084c28a9764b26dd70486f/FLAG1088a0996 [2022-02-20 23:36:55,731 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:36:55,732 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/forester-heap/dll-sorted-1.i [2022-02-20 23:36:55,743 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb6c96d22/119eba53ad084c28a9764b26dd70486f/FLAG1088a0996 [2022-02-20 23:36:55,754 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cb6c96d22/119eba53ad084c28a9764b26dd70486f [2022-02-20 23:36:55,757 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:36:55,758 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:36:55,763 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:36:55,763 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:36:55,765 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:36:55,766 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:36:55" (1/1) ... [2022-02-20 23:36:55,766 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ac94655 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:55, skipping insertion in model container [2022-02-20 23:36:55,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:36:55" (1/1) ... [2022-02-20 23:36:55,771 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:36:55,815 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:36:56,053 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-sorted-1.i[22384,22397] [2022-02-20 23:36:56,057 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-sorted-1.i[22614,22627] [2022-02-20 23:36:56,063 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-sorted-1.i[22989,23002] [2022-02-20 23:36:56,063 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-sorted-1.i[23053,23066] [2022-02-20 23:36:56,065 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-sorted-1.i[23184,23197] [2022-02-20 23:36:56,065 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-sorted-1.i[23248,23261] [2022-02-20 23:36:56,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:36:56,080 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:36:56,105 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-sorted-1.i[22384,22397] [2022-02-20 23:36:56,107 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-sorted-1.i[22614,22627] [2022-02-20 23:36:56,109 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-sorted-1.i[22989,23002] [2022-02-20 23:36:56,110 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-sorted-1.i[23053,23066] [2022-02-20 23:36:56,111 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-sorted-1.i[23184,23197] [2022-02-20 23:36:56,111 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-sorted-1.i[23248,23261] [2022-02-20 23:36:56,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:36:56,132 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:36:56,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:56 WrapperNode [2022-02-20 23:36:56,133 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:36:56,134 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:36:56,134 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:36:56,134 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:36:56,138 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:56" (1/1) ... [2022-02-20 23:36:56,150 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:56" (1/1) ... [2022-02-20 23:36:56,173 INFO L137 Inliner]: procedures = 122, calls = 45, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 190 [2022-02-20 23:36:56,173 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:36:56,173 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:36:56,174 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:36:56,174 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:36:56,179 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:56" (1/1) ... [2022-02-20 23:36:56,179 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:56" (1/1) ... [2022-02-20 23:36:56,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:56" (1/1) ... [2022-02-20 23:36:56,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:56" (1/1) ... [2022-02-20 23:36:56,192 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:56" (1/1) ... [2022-02-20 23:36:56,206 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:56" (1/1) ... [2022-02-20 23:36:56,207 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:56" (1/1) ... [2022-02-20 23:36:56,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:36:56,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:36:56,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:36:56,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:36:56,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:56" (1/1) ... [2022-02-20 23:36:56,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:36:56,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:36:56,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:36:56,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:36:56,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:36:56,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:36:56,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:36:56,263 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:36:56,263 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:36:56,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:36:56,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:36:56,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:36:56,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:36:56,264 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:36:56,335 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:36:56,337 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:36:56,825 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:36:56,831 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:36:56,831 INFO L299 CfgBuilder]: Removed 18 assume(true) statements. [2022-02-20 23:36:56,832 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:36:56 BoogieIcfgContainer [2022-02-20 23:36:56,832 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:36:56,833 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:36:56,833 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:36:56,835 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:36:56,835 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:36:55" (1/3) ... [2022-02-20 23:36:56,836 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136901cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:36:56, skipping insertion in model container [2022-02-20 23:36:56,836 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:56" (2/3) ... [2022-02-20 23:36:56,837 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@136901cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:36:56, skipping insertion in model container [2022-02-20 23:36:56,837 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:36:56" (3/3) ... [2022-02-20 23:36:56,843 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-sorted-1.i [2022-02-20 23:36:56,847 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:36:56,849 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 80 error locations. [2022-02-20 23:36:56,886 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:36:56,891 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:36:56,892 INFO L340 AbstractCegarLoop]: Starting to check reachability of 80 error locations. [2022-02-20 23:36:56,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 175 states, 94 states have (on average 2.223404255319149) internal successors, (209), 174 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:56,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:36:56,909 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:56,910 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:36:56,910 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:36:56,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:56,913 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:36:56,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:36:56,922 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2049914685] [2022-02-20 23:36:56,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:56,922 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:36:56,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:36:56,924 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:36:56,925 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:36:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:56,974 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:36:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:56,985 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:36:57,034 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:36:57,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {178#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(15bv32, 2bv32); {178#true} is VALID [2022-02-20 23:36:57,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {178#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem20#1, main_#t~short21#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {186#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:36:57,062 INFO L290 TraceCheckUtils]: 2: Hoare triple {186#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~head~0#1.base]); {179#false} is VALID [2022-02-20 23:36:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:57,063 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:36:57,064 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:36:57,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2049914685] [2022-02-20 23:36:57,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2049914685] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:57,064 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:57,065 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:36:57,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177851412] [2022-02-20 23:36:57,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:57,070 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:36:57,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:57,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:57,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:57,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:57,078 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:36:57,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:57,091 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:57,093 INFO L87 Difference]: Start difference. First operand has 175 states, 94 states have (on average 2.223404255319149) internal successors, (209), 174 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:57,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:57,563 INFO L93 Difference]: Finished difference Result 178 states and 188 transitions. [2022-02-20 23:36:57,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:57,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:36:57,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:57,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:57,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2022-02-20 23:36:57,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:57,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2022-02-20 23:36:57,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 216 transitions. [2022-02-20 23:36:57,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:57,787 INFO L225 Difference]: With dead ends: 178 [2022-02-20 23:36:57,787 INFO L226 Difference]: Without dead ends: 174 [2022-02-20 23:36:57,789 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:57,791 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 167 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:57,808 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 113 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:57,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-02-20 23:36:57,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 170. [2022-02-20 23:36:57,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:57,844 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 170 states, 93 states have (on average 1.935483870967742) internal successors, (180), 169 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:57,845 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 170 states, 93 states have (on average 1.935483870967742) internal successors, (180), 169 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:57,845 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 170 states, 93 states have (on average 1.935483870967742) internal successors, (180), 169 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:57,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:57,860 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2022-02-20 23:36:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 184 transitions. [2022-02-20 23:36:57,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:57,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:57,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 93 states have (on average 1.935483870967742) internal successors, (180), 169 states have internal predecessors, (180), 0 states have call successors, (0), 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 174 states. [2022-02-20 23:36:57,864 INFO L87 Difference]: Start difference. First operand has 170 states, 93 states have (on average 1.935483870967742) internal successors, (180), 169 states have internal predecessors, (180), 0 states have call successors, (0), 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 174 states. [2022-02-20 23:36:57,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:57,871 INFO L93 Difference]: Finished difference Result 174 states and 184 transitions. [2022-02-20 23:36:57,871 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 184 transitions. [2022-02-20 23:36:57,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:57,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:57,872 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:57,872 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 93 states have (on average 1.935483870967742) internal successors, (180), 169 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:57,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 180 transitions. [2022-02-20 23:36:57,877 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 180 transitions. Word has length 3 [2022-02-20 23:36:57,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:57,877 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 180 transitions. [2022-02-20 23:36:57,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:57,877 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 180 transitions. [2022-02-20 23:36:57,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:36:57,877 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:57,877 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:36:57,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-02-20 23:36:58,089 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:36:58,090 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:36:58,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:58,093 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:36:58,093 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:36:58,096 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1813884546] [2022-02-20 23:36:58,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:58,097 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:36:58,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:36:58,098 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:36:58,100 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:36:58,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:58,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:36:58,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:58,144 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:36:58,158 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:36:58,165 INFO L290 TraceCheckUtils]: 0: Hoare triple {885#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(15bv32, 2bv32); {885#true} is VALID [2022-02-20 23:36:58,166 INFO L290 TraceCheckUtils]: 1: Hoare triple {885#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem20#1, main_#t~short21#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {893#(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:36:58,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {893#(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)); {886#false} is VALID [2022-02-20 23:36:58,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:58,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:36:58,167 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:36:58,168 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1813884546] [2022-02-20 23:36:58,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1813884546] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:58,168 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:58,168 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:36:58,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737307000] [2022-02-20 23:36:58,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:58,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:36:58,170 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:58,170 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:58,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:58,174 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:58,174 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:36:58,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:58,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:58,175 INFO L87 Difference]: Start difference. First operand 170 states and 180 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:58,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:58,645 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2022-02-20 23:36:58,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:58,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:36:58,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:58,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:58,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2022-02-20 23:36:58,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:58,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2022-02-20 23:36:58,653 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 184 transitions. [2022-02-20 23:36:58,844 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 184 edges. 184 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:58,846 INFO L225 Difference]: With dead ends: 171 [2022-02-20 23:36:58,846 INFO L226 Difference]: Without dead ends: 171 [2022-02-20 23:36:58,846 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:58,847 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 162 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:58,847 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 111 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:36:58,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2022-02-20 23:36:58,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 167. [2022-02-20 23:36:58,851 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:58,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 171 states. Second operand has 167 states, 93 states have (on average 1.903225806451613) internal successors, (177), 166 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:36:58,852 INFO L74 IsIncluded]: Start isIncluded. First operand 171 states. Second operand has 167 states, 93 states have (on average 1.903225806451613) internal successors, (177), 166 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:36:58,852 INFO L87 Difference]: Start difference. First operand 171 states. Second operand has 167 states, 93 states have (on average 1.903225806451613) internal successors, (177), 166 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:36:58,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:58,856 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2022-02-20 23:36:58,856 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2022-02-20 23:36:58,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:58,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:58,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 93 states have (on average 1.903225806451613) internal successors, (177), 166 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 171 states. [2022-02-20 23:36:58,857 INFO L87 Difference]: Start difference. First operand has 167 states, 93 states have (on average 1.903225806451613) internal successors, (177), 166 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 171 states. [2022-02-20 23:36:58,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:58,861 INFO L93 Difference]: Finished difference Result 171 states and 181 transitions. [2022-02-20 23:36:58,861 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 181 transitions. [2022-02-20 23:36:58,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:58,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:58,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:58,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:58,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 93 states have (on average 1.903225806451613) internal successors, (177), 166 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:36:58,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 177 transitions. [2022-02-20 23:36:58,867 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 177 transitions. Word has length 3 [2022-02-20 23:36:58,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:58,868 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 177 transitions. [2022-02-20 23:36:58,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:58,868 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 177 transitions. [2022-02-20 23:36:58,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:36:58,868 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:58,869 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:58,887 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 23:36:59,075 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:36:59,075 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:36:59,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:59,076 INFO L85 PathProgramCache]: Analyzing trace with hash 59261803, now seen corresponding path program 1 times [2022-02-20 23:36:59,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:36:59,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258704430] [2022-02-20 23:36:59,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:59,077 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:36:59,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:36:59,089 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:36:59,091 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:36:59,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:59,141 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:36:59,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:59,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:36:59,156 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:36:59,196 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:36:59,197 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:36:59,206 INFO L290 TraceCheckUtils]: 0: Hoare triple {1576#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(15bv32, 2bv32); {1576#true} is VALID [2022-02-20 23:36:59,207 INFO L290 TraceCheckUtils]: 1: Hoare triple {1576#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem20#1, main_#t~short21#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {1584#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:36:59,207 INFO L290 TraceCheckUtils]: 2: Hoare triple {1584#(= (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: L998 {1584#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:36:59,208 INFO L290 TraceCheckUtils]: 3: Hoare triple {1584#(= (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: L998-1 {1584#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:36:59,208 INFO L290 TraceCheckUtils]: 4: Hoare triple {1584#(= (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: L999 {1584#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:36:59,209 INFO L290 TraceCheckUtils]: 5: Hoare triple {1584#(= (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;main_~marked~0#1 := 0bv32; {1597#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:36:59,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {1597#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} assume !!(0bv32 != main_#t~nondet2#1 || 0bv32 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {1597#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:36:59,210 INFO L290 TraceCheckUtils]: 7: Hoare triple {1597#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~x~0#1.base]); {1577#false} is VALID [2022-02-20 23:36:59,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:59,210 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:36:59,211 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:36:59,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258704430] [2022-02-20 23:36:59,211 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258704430] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:59,211 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:59,211 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:36:59,211 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040796605] [2022-02-20 23:36:59,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:59,212 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:36:59,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:59,212 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:36:59,221 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:36:59,221 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:36:59,221 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:36:59,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:36:59,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:36:59,222 INFO L87 Difference]: Start difference. First operand 167 states and 177 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:36:59,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:59,818 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2022-02-20 23:36:59,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:36:59,818 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:36:59,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:59,819 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:36:59,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2022-02-20 23:36:59,821 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:36:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 211 transitions. [2022-02-20 23:36:59,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 211 transitions. [2022-02-20 23:37:00,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:00,010 INFO L225 Difference]: With dead ends: 174 [2022-02-20 23:37:00,010 INFO L226 Difference]: Without dead ends: 174 [2022-02-20 23:37:00,010 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:37:00,011 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 285 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:00,011 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [285 Valid, 84 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:37:00,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-02-20 23:37:00,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 163. [2022-02-20 23:37:00,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:00,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 163 states, 107 states have (on average 1.719626168224299) internal successors, (184), 162 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:00,016 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 163 states, 107 states have (on average 1.719626168224299) internal successors, (184), 162 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:00,017 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 163 states, 107 states have (on average 1.719626168224299) internal successors, (184), 162 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:00,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:00,020 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2022-02-20 23:37:00,020 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2022-02-20 23:37:00,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:00,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:00,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 107 states have (on average 1.719626168224299) internal successors, (184), 162 states have internal predecessors, (184), 0 states have call successors, (0), 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 174 states. [2022-02-20 23:37:00,025 INFO L87 Difference]: Start difference. First operand has 163 states, 107 states have (on average 1.719626168224299) internal successors, (184), 162 states have internal predecessors, (184), 0 states have call successors, (0), 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 174 states. [2022-02-20 23:37:00,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:00,028 INFO L93 Difference]: Finished difference Result 174 states and 187 transitions. [2022-02-20 23:37:00,028 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 187 transitions. [2022-02-20 23:37:00,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:00,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:00,029 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:00,029 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:00,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 107 states have (on average 1.719626168224299) internal successors, (184), 162 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:00,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 184 transitions. [2022-02-20 23:37:00,032 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 184 transitions. Word has length 8 [2022-02-20 23:37:00,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:00,032 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 184 transitions. [2022-02-20 23:37:00,032 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:37:00,033 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 184 transitions. [2022-02-20 23:37:00,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:37:00,033 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:00,033 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:00,039 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:37:00,239 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:37:00,240 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:37:00,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:00,240 INFO L85 PathProgramCache]: Analyzing trace with hash 59261804, now seen corresponding path program 1 times [2022-02-20 23:37:00,241 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:00,241 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [73585651] [2022-02-20 23:37:00,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:00,241 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:00,241 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:00,242 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:37:00,244 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:37:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:00,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:37:00,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:00,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:00,341 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:37:00,425 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:37:00,426 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:37:00,449 INFO L290 TraceCheckUtils]: 0: Hoare triple {2290#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(15bv32, 2bv32); {2290#true} is VALID [2022-02-20 23:37:00,449 INFO L290 TraceCheckUtils]: 1: Hoare triple {2290#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem20#1, main_#t~short21#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {2298#(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:37:00,450 INFO L290 TraceCheckUtils]: 2: Hoare triple {2298#(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: L998 {2298#(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:37:00,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {2298#(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: L998-1 {2298#(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:37:00,451 INFO L290 TraceCheckUtils]: 4: Hoare triple {2298#(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: L999 {2298#(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:37:00,452 INFO L290 TraceCheckUtils]: 5: Hoare triple {2298#(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;main_~marked~0#1 := 0bv32; {2311#(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:37:00,452 INFO L290 TraceCheckUtils]: 6: Hoare triple {2311#(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 || 0bv32 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {2311#(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:37:00,453 INFO L290 TraceCheckUtils]: 7: Hoare triple {2311#(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)); {2291#false} is VALID [2022-02-20 23:37:00,453 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:37:00,453 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:00,453 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:00,453 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [73585651] [2022-02-20 23:37:00,453 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [73585651] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:00,453 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:00,453 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:37:00,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [930980254] [2022-02-20 23:37:00,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:00,454 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:37:00,454 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:00,454 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:37:00,463 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:37:00,463 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:37:00,464 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:00,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:37:00,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:37:00,464 INFO L87 Difference]: Start difference. First operand 163 states and 184 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:37:01,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:01,394 INFO L93 Difference]: Finished difference Result 251 states and 273 transitions. [2022-02-20 23:37:01,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:37:01,394 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:37:01,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:01,394 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:37:01,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 287 transitions. [2022-02-20 23:37:01,396 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:37:01,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 287 transitions. [2022-02-20 23:37:01,398 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 287 transitions. [2022-02-20 23:37:01,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 287 edges. 287 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:01,721 INFO L225 Difference]: With dead ends: 251 [2022-02-20 23:37:01,721 INFO L226 Difference]: Without dead ends: 251 [2022-02-20 23:37:01,721 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:37:01,722 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 328 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 186 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:01,722 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [328 Valid, 138 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 186 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:37:01,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-02-20 23:37:01,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 213. [2022-02-20 23:37:01,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:01,729 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand has 213 states, 157 states have (on average 1.624203821656051) internal successors, (255), 212 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:01,729 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand has 213 states, 157 states have (on average 1.624203821656051) internal successors, (255), 212 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:01,729 INFO L87 Difference]: Start difference. First operand 251 states. Second operand has 213 states, 157 states have (on average 1.624203821656051) internal successors, (255), 212 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:01,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:01,734 INFO L93 Difference]: Finished difference Result 251 states and 273 transitions. [2022-02-20 23:37:01,734 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 273 transitions. [2022-02-20 23:37:01,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:01,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:01,735 INFO L74 IsIncluded]: Start isIncluded. First operand has 213 states, 157 states have (on average 1.624203821656051) internal successors, (255), 212 states have internal predecessors, (255), 0 states have call successors, (0), 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 251 states. [2022-02-20 23:37:01,735 INFO L87 Difference]: Start difference. First operand has 213 states, 157 states have (on average 1.624203821656051) internal successors, (255), 212 states have internal predecessors, (255), 0 states have call successors, (0), 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 251 states. [2022-02-20 23:37:01,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:01,740 INFO L93 Difference]: Finished difference Result 251 states and 273 transitions. [2022-02-20 23:37:01,740 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 273 transitions. [2022-02-20 23:37:01,740 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:01,740 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:01,740 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:01,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:01,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 157 states have (on average 1.624203821656051) internal successors, (255), 212 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:01,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 255 transitions. [2022-02-20 23:37:01,744 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 255 transitions. Word has length 8 [2022-02-20 23:37:01,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:01,744 INFO L470 AbstractCegarLoop]: Abstraction has 213 states and 255 transitions. [2022-02-20 23:37:01,744 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:37:01,744 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 255 transitions. [2022-02-20 23:37:01,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:37:01,745 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:01,745 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:01,752 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:37:01,951 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:37:01,951 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:37:01,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:01,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1115996916, now seen corresponding path program 1 times [2022-02-20 23:37:01,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:01,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [690451067] [2022-02-20 23:37:01,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:01,952 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:01,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:01,953 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:37:01,955 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:37:01,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:01,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:37:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:02,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:02,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {3285#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(15bv32, 2bv32); {3285#true} is VALID [2022-02-20 23:37:02,023 INFO L290 TraceCheckUtils]: 1: Hoare triple {3285#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem20#1, main_#t~short21#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {3285#true} is VALID [2022-02-20 23:37:02,023 INFO L290 TraceCheckUtils]: 2: Hoare triple {3285#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L998 {3285#true} is VALID [2022-02-20 23:37:02,023 INFO L290 TraceCheckUtils]: 3: Hoare triple {3285#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L998-1 {3285#true} is VALID [2022-02-20 23:37:02,023 INFO L290 TraceCheckUtils]: 4: Hoare triple {3285#true} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(8bv32, main_~head~0#1.offset), 4bv32); srcloc: L999 {3285#true} is VALID [2022-02-20 23:37:02,024 INFO L290 TraceCheckUtils]: 5: Hoare triple {3285#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0bv32; {3305#(= (_ bv0 32) |ULTIMATE.start_main_~marked~0#1|)} is VALID [2022-02-20 23:37:02,024 INFO L290 TraceCheckUtils]: 6: Hoare triple {3305#(= (_ bv0 32) |ULTIMATE.start_main_~marked~0#1|)} assume !(0bv32 != main_#t~nondet2#1 || 0bv32 == main_~marked~0#1);havoc main_#t~nondet2#1; {3286#false} is VALID [2022-02-20 23:37:02,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {3286#false} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {3286#false} is VALID [2022-02-20 23:37:02,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {3286#false} assume !(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {3286#false} is VALID [2022-02-20 23:37:02,024 INFO L290 TraceCheckUtils]: 9: Hoare triple {3286#false} assume !false; {3286#false} is VALID [2022-02-20 23:37:02,024 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:37:02,024 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:02,025 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:02,025 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [690451067] [2022-02-20 23:37:02,025 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [690451067] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:02,025 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:02,025 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:37:02,025 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28110931] [2022-02-20 23:37:02,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:02,025 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 23:37:02,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:02,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:02,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:02,034 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:37:02,034 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:02,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:37:02,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:37:02,035 INFO L87 Difference]: Start difference. First operand 213 states and 255 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:02,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:02,336 INFO L93 Difference]: Finished difference Result 257 states and 302 transitions. [2022-02-20 23:37:02,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:37:02,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 23:37:02,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:02,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:02,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2022-02-20 23:37:02,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:02,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2022-02-20 23:37:02,339 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 201 transitions. [2022-02-20 23:37:02,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:02,508 INFO L225 Difference]: With dead ends: 257 [2022-02-20 23:37:02,508 INFO L226 Difference]: Without dead ends: 257 [2022-02-20 23:37:02,508 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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:37:02,509 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 116 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:02,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 228 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:37:02,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2022-02-20 23:37:02,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 224. [2022-02-20 23:37:02,523 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:02,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 257 states. Second operand has 224 states, 168 states have (on average 1.625) internal successors, (273), 223 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:02,524 INFO L74 IsIncluded]: Start isIncluded. First operand 257 states. Second operand has 224 states, 168 states have (on average 1.625) internal successors, (273), 223 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:02,525 INFO L87 Difference]: Start difference. First operand 257 states. Second operand has 224 states, 168 states have (on average 1.625) internal successors, (273), 223 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:02,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:02,543 INFO L93 Difference]: Finished difference Result 257 states and 302 transitions. [2022-02-20 23:37:02,543 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 302 transitions. [2022-02-20 23:37:02,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:02,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:02,544 INFO L74 IsIncluded]: Start isIncluded. First operand has 224 states, 168 states have (on average 1.625) internal successors, (273), 223 states have internal predecessors, (273), 0 states have call successors, (0), 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 257 states. [2022-02-20 23:37:02,545 INFO L87 Difference]: Start difference. First operand has 224 states, 168 states have (on average 1.625) internal successors, (273), 223 states have internal predecessors, (273), 0 states have call successors, (0), 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 257 states. [2022-02-20 23:37:02,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:02,549 INFO L93 Difference]: Finished difference Result 257 states and 302 transitions. [2022-02-20 23:37:02,549 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 302 transitions. [2022-02-20 23:37:02,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:02,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:02,550 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:02,550 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:02,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 168 states have (on average 1.625) internal successors, (273), 223 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:02,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 273 transitions. [2022-02-20 23:37:02,563 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 273 transitions. Word has length 10 [2022-02-20 23:37:02,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:02,564 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 273 transitions. [2022-02-20 23:37:02,564 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:02,564 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 273 transitions. [2022-02-20 23:37:02,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:37:02,579 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:02,579 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:02,588 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:37:02,780 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:37:02,780 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:37:02,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:02,780 INFO L85 PathProgramCache]: Analyzing trace with hash 236809587, now seen corresponding path program 1 times [2022-02-20 23:37:02,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:02,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [114135214] [2022-02-20 23:37:02,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:02,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:02,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:02,782 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:37:02,784 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:37:02,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:02,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:37:02,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:02,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:02,861 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:37:02,875 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:37:02,893 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:37:02,898 INFO L290 TraceCheckUtils]: 0: Hoare triple {4312#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(15bv32, 2bv32); {4312#true} is VALID [2022-02-20 23:37:02,899 INFO L290 TraceCheckUtils]: 1: Hoare triple {4312#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem20#1, main_#t~short21#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {4312#true} is VALID [2022-02-20 23:37:02,899 INFO L290 TraceCheckUtils]: 2: Hoare triple {4312#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L998 {4312#true} is VALID [2022-02-20 23:37:02,899 INFO L290 TraceCheckUtils]: 3: Hoare triple {4312#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L998-1 {4312#true} is VALID [2022-02-20 23:37:02,899 INFO L290 TraceCheckUtils]: 4: Hoare triple {4312#true} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(8bv32, main_~head~0#1.offset), 4bv32); srcloc: L999 {4312#true} is VALID [2022-02-20 23:37:02,899 INFO L290 TraceCheckUtils]: 5: Hoare triple {4312#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0bv32; {4312#true} is VALID [2022-02-20 23:37:02,900 INFO L290 TraceCheckUtils]: 6: Hoare triple {4312#true} assume !!(0bv32 != main_#t~nondet2#1 || 0bv32 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {4335#(= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:02,901 INFO L290 TraceCheckUtils]: 7: Hoare triple {4335#(= (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: L1009 {4339#(= (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:37:02,902 INFO L290 TraceCheckUtils]: 8: Hoare triple {4339#(= (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; {4339#(= (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:37:02,902 INFO L290 TraceCheckUtils]: 9: Hoare triple {4339#(= (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: L1010 {4346#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:02,903 INFO L290 TraceCheckUtils]: 10: Hoare triple {4346#(= (select |#valid| |ULTIMATE.start_main_#t~mem4#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_#t~mem4#1.base]); {4313#false} is VALID [2022-02-20 23:37:02,903 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:37:02,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:02,903 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:02,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [114135214] [2022-02-20 23:37:02,903 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [114135214] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:02,904 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:02,904 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:37:02,904 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017908520] [2022-02-20 23:37:02,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:02,904 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:37:02,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:02,904 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:37:02,916 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:37:02,916 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:37:02,916 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:02,917 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:37:02,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:37:02,917 INFO L87 Difference]: Start difference. First operand 224 states and 273 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:37:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:03,982 INFO L93 Difference]: Finished difference Result 223 states and 270 transitions. [2022-02-20 23:37:03,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:37:03,982 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:37:03,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:03,982 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:37:03,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2022-02-20 23:37:03,983 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:37:03,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 159 transitions. [2022-02-20 23:37:03,984 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 159 transitions. [2022-02-20 23:37:04,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:04,117 INFO L225 Difference]: With dead ends: 223 [2022-02-20 23:37:04,117 INFO L226 Difference]: Without dead ends: 223 [2022-02-20 23:37:04,117 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:37:04,118 INFO L933 BasicCegarLoop]: 151 mSDtfsCounter, 9 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:04,118 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 406 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:37:04,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2022-02-20 23:37:04,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2022-02-20 23:37:04,122 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:04,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 223 states. Second operand has 223 states, 168 states have (on average 1.6071428571428572) internal successors, (270), 222 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:04,126 INFO L74 IsIncluded]: Start isIncluded. First operand 223 states. Second operand has 223 states, 168 states have (on average 1.6071428571428572) internal successors, (270), 222 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:04,126 INFO L87 Difference]: Start difference. First operand 223 states. Second operand has 223 states, 168 states have (on average 1.6071428571428572) internal successors, (270), 222 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:04,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:04,130 INFO L93 Difference]: Finished difference Result 223 states and 270 transitions. [2022-02-20 23:37:04,130 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 270 transitions. [2022-02-20 23:37:04,130 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:04,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:04,131 INFO L74 IsIncluded]: Start isIncluded. First operand has 223 states, 168 states have (on average 1.6071428571428572) internal successors, (270), 222 states have internal predecessors, (270), 0 states have call successors, (0), 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 223 states. [2022-02-20 23:37:04,131 INFO L87 Difference]: Start difference. First operand has 223 states, 168 states have (on average 1.6071428571428572) internal successors, (270), 222 states have internal predecessors, (270), 0 states have call successors, (0), 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 223 states. [2022-02-20 23:37:04,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:04,135 INFO L93 Difference]: Finished difference Result 223 states and 270 transitions. [2022-02-20 23:37:04,135 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 270 transitions. [2022-02-20 23:37:04,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:04,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:04,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:04,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:04,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 223 states, 168 states have (on average 1.6071428571428572) internal successors, (270), 222 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:04,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 270 transitions. [2022-02-20 23:37:04,139 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 270 transitions. Word has length 11 [2022-02-20 23:37:04,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:04,139 INFO L470 AbstractCegarLoop]: Abstraction has 223 states and 270 transitions. [2022-02-20 23:37:04,139 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:37:04,139 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 270 transitions. [2022-02-20 23:37:04,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:37:04,140 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:04,140 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:04,148 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:37:04,346 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:37:04,347 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:37:04,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:04,348 INFO L85 PathProgramCache]: Analyzing trace with hash 236809588, now seen corresponding path program 1 times [2022-02-20 23:37:04,348 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:04,348 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [835882226] [2022-02-20 23:37:04,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:04,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:04,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:04,354 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:37:04,355 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:37:04,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:04,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:37:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:04,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:04,447 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:37:04,467 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:37:04,471 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:37:04,499 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:37:04,502 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:37:04,511 INFO L290 TraceCheckUtils]: 0: Hoare triple {5245#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(15bv32, 2bv32); {5245#true} is VALID [2022-02-20 23:37:04,511 INFO L290 TraceCheckUtils]: 1: Hoare triple {5245#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem20#1, main_#t~short21#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {5245#true} is VALID [2022-02-20 23:37:04,511 INFO L290 TraceCheckUtils]: 2: Hoare triple {5245#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L998 {5245#true} is VALID [2022-02-20 23:37:04,512 INFO L290 TraceCheckUtils]: 3: Hoare triple {5245#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L998-1 {5245#true} is VALID [2022-02-20 23:37:04,512 INFO L290 TraceCheckUtils]: 4: Hoare triple {5245#true} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(8bv32, main_~head~0#1.offset), 4bv32); srcloc: L999 {5245#true} is VALID [2022-02-20 23:37:04,512 INFO L290 TraceCheckUtils]: 5: Hoare triple {5245#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0bv32; {5245#true} is VALID [2022-02-20 23:37:04,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {5245#true} assume !!(0bv32 != main_#t~nondet2#1 || 0bv32 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {5268#(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:37:04,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {5268#(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: L1009 {5272#(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:37:04,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {5272#(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; {5272#(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:37:04,523 INFO L290 TraceCheckUtils]: 9: Hoare triple {5272#(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: L1010 {5279#(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:37:04,523 INFO L290 TraceCheckUtils]: 10: Hoare triple {5279#(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))); {5246#false} is VALID [2022-02-20 23:37:04,523 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:37:04,523 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:04,524 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:04,524 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [835882226] [2022-02-20 23:37:04,524 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [835882226] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:04,524 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:04,524 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:37:04,524 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425695539] [2022-02-20 23:37:04,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:04,525 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:37:04,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:04,525 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:37:04,537 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:37:04,538 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:37:04,538 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:04,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:37:04,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:37:04,539 INFO L87 Difference]: Start difference. First operand 223 states and 270 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:37:05,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:05,799 INFO L93 Difference]: Finished difference Result 222 states and 267 transitions. [2022-02-20 23:37:05,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:37:05,800 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:37:05,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:05,800 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:37:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2022-02-20 23:37:05,801 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:37:05,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 158 transitions. [2022-02-20 23:37:05,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 158 transitions. [2022-02-20 23:37:05,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:05,934 INFO L225 Difference]: With dead ends: 222 [2022-02-20 23:37:05,934 INFO L226 Difference]: Without dead ends: 222 [2022-02-20 23:37:05,934 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:37:05,934 INFO L933 BasicCegarLoop]: 152 mSDtfsCounter, 4 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:05,934 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 386 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:37:05,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2022-02-20 23:37:05,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 222. [2022-02-20 23:37:05,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:05,937 INFO L82 GeneralOperation]: Start isEquivalent. First operand 222 states. Second operand has 222 states, 168 states have (on average 1.5892857142857142) internal successors, (267), 221 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:05,938 INFO L74 IsIncluded]: Start isIncluded. First operand 222 states. Second operand has 222 states, 168 states have (on average 1.5892857142857142) internal successors, (267), 221 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:05,938 INFO L87 Difference]: Start difference. First operand 222 states. Second operand has 222 states, 168 states have (on average 1.5892857142857142) internal successors, (267), 221 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:05,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:05,941 INFO L93 Difference]: Finished difference Result 222 states and 267 transitions. [2022-02-20 23:37:05,941 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 267 transitions. [2022-02-20 23:37:05,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:05,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:05,942 INFO L74 IsIncluded]: Start isIncluded. First operand has 222 states, 168 states have (on average 1.5892857142857142) internal successors, (267), 221 states have internal predecessors, (267), 0 states have call successors, (0), 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 222 states. [2022-02-20 23:37:05,942 INFO L87 Difference]: Start difference. First operand has 222 states, 168 states have (on average 1.5892857142857142) internal successors, (267), 221 states have internal predecessors, (267), 0 states have call successors, (0), 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 222 states. [2022-02-20 23:37:05,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:05,945 INFO L93 Difference]: Finished difference Result 222 states and 267 transitions. [2022-02-20 23:37:05,945 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 267 transitions. [2022-02-20 23:37:05,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:05,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:05,946 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:05,946 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:05,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 222 states, 168 states have (on average 1.5892857142857142) internal successors, (267), 221 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:05,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 267 transitions. [2022-02-20 23:37:05,949 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 267 transitions. Word has length 11 [2022-02-20 23:37:05,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:05,949 INFO L470 AbstractCegarLoop]: Abstraction has 222 states and 267 transitions. [2022-02-20 23:37:05,949 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:37:05,949 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 267 transitions. [2022-02-20 23:37:05,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:37:05,950 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:05,950 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:05,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:37:06,156 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:37:06,157 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:37:06,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:06,157 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053835, now seen corresponding path program 1 times [2022-02-20 23:37:06,158 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:06,158 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2131253311] [2022-02-20 23:37:06,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:06,158 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:06,158 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:06,159 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:37:06,161 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:37:06,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:06,260 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:37:06,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:06,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:06,292 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:37:06,293 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:37:06,407 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-02-20 23:37:06,408 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:37:06,516 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:37:06,733 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:37:06,734 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:37:06,857 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:37:07,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {6174#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(15bv32, 2bv32); {6179#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} is VALID [2022-02-20 23:37:07,284 INFO L290 TraceCheckUtils]: 1: Hoare triple {6179#(= (_ 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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem20#1, main_#t~short21#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {6183#(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:37:07,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {6183#(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: L998 {6183#(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:37:07,286 INFO L290 TraceCheckUtils]: 3: Hoare triple {6183#(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: L998-1 {6183#(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:37:07,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {6183#(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: L999 {6183#(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:37:07,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {6183#(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;main_~marked~0#1 := 0bv32; {6196#(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:37:07,290 INFO L290 TraceCheckUtils]: 6: Hoare triple {6196#(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 || 0bv32 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {6200#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1)) (exists ((v_arrayElimCell_9 (_ BitVec 1))) (and (or (= |ULTIMATE.start_main_#t~malloc3#1.base| (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_9) (select |#valid| (_ bv0 32))) (_ bv0 1))) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32))))) (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:37:07,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {6200#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1)) (exists ((v_arrayElimCell_9 (_ BitVec 1))) (and (or (= |ULTIMATE.start_main_#t~malloc3#1.base| (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_9) (select |#valid| (_ bv0 32))) (_ bv0 1))) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32))))) (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: L1009 {6204#(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|)) (_ bv1 1)) (exists ((v_arrayElimCell_9 (_ BitVec 1))) (and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_9) (select |#valid| (_ bv0 32))) (_ bv0 1))) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32))))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:37:07,300 INFO L290 TraceCheckUtils]: 8: Hoare triple {6204#(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|)) (_ bv1 1)) (exists ((v_arrayElimCell_9 (_ BitVec 1))) (and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_9) (select |#valid| (_ bv0 32))) (_ bv0 1))) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32))))) (= (_ 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; {6204#(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|)) (_ bv1 1)) (exists ((v_arrayElimCell_9 (_ BitVec 1))) (and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_9) (select |#valid| (_ bv0 32))) (_ bv0 1))) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32))))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:37:07,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {6204#(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|)) (_ bv1 1)) (exists ((v_arrayElimCell_9 (_ BitVec 1))) (and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_9) (select |#valid| (_ bv0 32))) (_ bv0 1))) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32))))) (= (_ 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: L1010 {6211#(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|)) (_ bv1 1)) (exists ((v_arrayElimCell_9 (_ BitVec 1))) (and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_9) (select |#valid| (_ bv0 32))) (_ bv0 1))) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32))))) (= (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:37:07,311 INFO L290 TraceCheckUtils]: 10: Hoare triple {6211#(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|)) (_ bv1 1)) (exists ((v_arrayElimCell_9 (_ BitVec 1))) (and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_9) (select |#valid| (_ bv0 32))) (_ bv0 1))) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32))))) (= (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: L1010-1 {6204#(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|)) (_ bv1 1)) (exists ((v_arrayElimCell_9 (_ BitVec 1))) (and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_9) (select |#valid| (_ bv0 32))) (_ bv0 1))) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32))))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:37:07,312 INFO L290 TraceCheckUtils]: 11: Hoare triple {6204#(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|)) (_ bv1 1)) (exists ((v_arrayElimCell_9 (_ BitVec 1))) (and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_9) (select |#valid| (_ bv0 32))) (_ bv0 1))) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32))))) (= (_ 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; {6204#(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|)) (_ bv1 1)) (exists ((v_arrayElimCell_9 (_ BitVec 1))) (and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_9) (select |#valid| (_ bv0 32))) (_ bv0 1))) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32))))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:37:07,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {6204#(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|)) (_ bv1 1)) (exists ((v_arrayElimCell_9 (_ BitVec 1))) (and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_9) (select |#valid| (_ bv0 32))) (_ bv0 1))) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32))))) (= (_ 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: L1011 {6221#(and (= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv1 1)) (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (or (= |ULTIMATE.start_main_#t~mem5#1.base| (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_9) (select |#valid| (_ bv0 32))) (_ bv0 1))) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))))} is VALID [2022-02-20 23:37:07,318 INFO L290 TraceCheckUtils]: 13: Hoare triple {6221#(and (= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv1 1)) (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (or (= |ULTIMATE.start_main_#t~mem5#1.base| (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_9) (select |#valid| (_ bv0 32))) (_ bv0 1))) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32))) (= (_ 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; {6225#(and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~x~0#1.base_96| (_ BitVec 32))) (and (or (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_9) (select |#valid| (_ bv0 32))) (_ bv0 1))) (not (= |v_ULTIMATE.start_main_~x~0#1.base_96| |ULTIMATE.start_main_~x~0#1.base|)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~x~0#1.base_96| (_ bv0 32))) (= (_ bv0 1) (bvadd (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_96|) (_ bv1 1))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:37:07,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {6225#(and (exists ((v_arrayElimCell_9 (_ BitVec 1)) (|v_ULTIMATE.start_main_~x~0#1.base_96| (_ BitVec 32))) (and (or (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_9) (select |#valid| (_ bv0 32))) (_ bv0 1))) (not (= |v_ULTIMATE.start_main_~x~0#1.base_96| |ULTIMATE.start_main_~x~0#1.base|)) (or (= v_arrayElimCell_9 (_ bv0 1)) (= |v_ULTIMATE.start_main_~x~0#1.base_96| (_ bv0 32))) (= (_ bv0 1) (bvadd (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_96|) (_ bv1 1))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} assume !(1bv1 == #valid[main_~x~0#1.base]); {6175#false} is VALID [2022-02-20 23:37:07,319 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:37:07,319 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:07,319 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:07,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2131253311] [2022-02-20 23:37:07,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2131253311] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:07,319 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:07,319 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:37:07,320 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685344757] [2022-02-20 23:37:07,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:07,320 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:37:07,320 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:07,320 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:37:07,356 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:37:07,356 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:37:07,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:07,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:37:07,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:37:07,357 INFO L87 Difference]: Start difference. First operand 222 states and 267 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) [2022-02-20 23:37:08,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:08,819 INFO L93 Difference]: Finished difference Result 224 states and 270 transitions. [2022-02-20 23:37:08,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:37:08,819 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:37:08,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:08,819 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 23:37:08,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2022-02-20 23:37:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. 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) [2022-02-20 23:37:08,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 168 transitions. [2022-02-20 23:37:08,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 168 transitions. [2022-02-20 23:37:08,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:08,977 INFO L225 Difference]: With dead ends: 224 [2022-02-20 23:37:08,977 INFO L226 Difference]: Without dead ends: 224 [2022-02-20 23:37:08,978 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=191, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:37:08,978 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 27 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 160 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:08,978 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 557 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 208 Invalid, 0 Unknown, 160 Unchecked, 0.3s Time] [2022-02-20 23:37:08,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-02-20 23:37:08,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 224. [2022-02-20 23:37:08,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:08,981 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand has 224 states, 170 states have (on average 1.588235294117647) internal successors, (270), 223 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:08,981 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand has 224 states, 170 states have (on average 1.588235294117647) internal successors, (270), 223 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:08,982 INFO L87 Difference]: Start difference. First operand 224 states. Second operand has 224 states, 170 states have (on average 1.588235294117647) internal successors, (270), 223 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:08,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:08,985 INFO L93 Difference]: Finished difference Result 224 states and 270 transitions. [2022-02-20 23:37:08,985 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 270 transitions. [2022-02-20 23:37:08,985 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:08,985 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:08,986 INFO L74 IsIncluded]: Start isIncluded. First operand has 224 states, 170 states have (on average 1.588235294117647) internal successors, (270), 223 states have internal predecessors, (270), 0 states have call successors, (0), 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 224 states. [2022-02-20 23:37:08,986 INFO L87 Difference]: Start difference. First operand has 224 states, 170 states have (on average 1.588235294117647) internal successors, (270), 223 states have internal predecessors, (270), 0 states have call successors, (0), 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 224 states. [2022-02-20 23:37:08,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:08,989 INFO L93 Difference]: Finished difference Result 224 states and 270 transitions. [2022-02-20 23:37:08,989 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 270 transitions. [2022-02-20 23:37:08,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:08,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:08,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:08,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:08,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 170 states have (on average 1.588235294117647) internal successors, (270), 223 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:08,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 270 transitions. [2022-02-20 23:37:08,993 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 270 transitions. Word has length 15 [2022-02-20 23:37:08,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:08,994 INFO L470 AbstractCegarLoop]: Abstraction has 224 states and 270 transitions. [2022-02-20 23:37:08,994 INFO L471 AbstractCegarLoop]: INTERPOLANT 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) [2022-02-20 23:37:08,994 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 270 transitions. [2022-02-20 23:37:08,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:37:08,994 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:08,994 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:09,003 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:37:09,201 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:37:09,201 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:37:09,202 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:09,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1108053834, now seen corresponding path program 1 times [2022-02-20 23:37:09,202 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:09,202 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [552288880] [2022-02-20 23:37:09,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:09,203 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:09,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:09,204 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:37:09,205 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:37:09,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:09,280 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 22 conjunts are in the unsatisfiable core [2022-02-20 23:37:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:09,291 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:09,299 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:37:09,333 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:37:09,342 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:37:09,342 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:37:09,377 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:37:09,387 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:37:09,464 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:37:09,464 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:37:09,469 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:37:09,498 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:37:09,501 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 25 treesize of output 13 [2022-02-20 23:37:09,536 INFO L290 TraceCheckUtils]: 0: Hoare triple {7139#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(15bv32, 2bv32); {7139#true} is VALID [2022-02-20 23:37:09,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {7139#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem20#1, main_#t~short21#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {7147#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:09,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {7147#(= (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: L998 {7147#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:09,538 INFO L290 TraceCheckUtils]: 3: Hoare triple {7147#(= (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: L998-1 {7147#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:09,538 INFO L290 TraceCheckUtils]: 4: Hoare triple {7147#(= (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: L999 {7147#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:09,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {7147#(= (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;main_~marked~0#1 := 0bv32; {7160#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:09,540 INFO L290 TraceCheckUtils]: 6: Hoare triple {7160#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} assume !!(0bv32 != main_#t~nondet2#1 || 0bv32 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {7164#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv12 32)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc3#1.base|)) (= |ULTIMATE.start_main_#t~malloc3#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:37:09,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {7164#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv12 32)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~malloc3#1.base|)) (= |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: L1009 {7168#(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 |#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:37:09,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {7168#(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 |#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; {7168#(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 |#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:37:09,542 INFO L290 TraceCheckUtils]: 9: Hoare triple {7168#(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 |#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: L1010 {7175#(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 (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|) (= (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:37:09,545 INFO L290 TraceCheckUtils]: 10: Hoare triple {7175#(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 (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|) (= (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 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: L1010-1 {7168#(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 |#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:37:09,545 INFO L290 TraceCheckUtils]: 11: Hoare triple {7168#(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 |#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~mem4#1.base, main_#t~mem4#1.offset; {7168#(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 |#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:37:09,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {7168#(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 |#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~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1011 {7185#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv12 32)))} is VALID [2022-02-20 23:37:09,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {7185#(and (= |ULTIMATE.start_main_#t~mem5#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv12 32)))} 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; {7189#(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:37:09,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {7189#(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)); {7140#false} is VALID [2022-02-20 23:37:09,547 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:37:09,547 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:09,547 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:09,547 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [552288880] [2022-02-20 23:37:09,547 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [552288880] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:09,547 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:09,547 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:37:09,547 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995794393] [2022-02-20 23:37:09,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:09,547 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) 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:37:09,548 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:09,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 1.875) 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:37:09,566 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:37:09,566 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:37:09,566 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:09,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:37:09,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:37:09,567 INFO L87 Difference]: Start difference. First operand 224 states and 270 transitions. Second operand has 9 states, 8 states have (on average 1.875) 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:37:12,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:12,437 INFO L93 Difference]: Finished difference Result 225 states and 262 transitions. [2022-02-20 23:37:12,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:37:12,437 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 1.875) 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:37:12,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:12,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) 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:37:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 189 transitions. [2022-02-20 23:37:12,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.875) 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:37:12,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 189 transitions. [2022-02-20 23:37:12,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 189 transitions. [2022-02-20 23:37:12,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:12,616 INFO L225 Difference]: With dead ends: 225 [2022-02-20 23:37:12,616 INFO L226 Difference]: Without dead ends: 225 [2022-02-20 23:37:12,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:37:12,617 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 275 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 660 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:12,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 354 Invalid, 660 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 629 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 23:37:12,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-02-20 23:37:12,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 218. [2022-02-20 23:37:12,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:12,620 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 218 states, 170 states have (on average 1.5235294117647058) internal successors, (259), 217 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:12,620 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 218 states, 170 states have (on average 1.5235294117647058) internal successors, (259), 217 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:12,620 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 218 states, 170 states have (on average 1.5235294117647058) internal successors, (259), 217 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:12,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:12,623 INFO L93 Difference]: Finished difference Result 225 states and 262 transitions. [2022-02-20 23:37:12,623 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 262 transitions. [2022-02-20 23:37:12,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:12,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:12,624 INFO L74 IsIncluded]: Start isIncluded. First operand has 218 states, 170 states have (on average 1.5235294117647058) internal successors, (259), 217 states have internal predecessors, (259), 0 states have call successors, (0), 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 225 states. [2022-02-20 23:37:12,624 INFO L87 Difference]: Start difference. First operand has 218 states, 170 states have (on average 1.5235294117647058) internal successors, (259), 217 states have internal predecessors, (259), 0 states have call successors, (0), 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 225 states. [2022-02-20 23:37:12,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:12,627 INFO L93 Difference]: Finished difference Result 225 states and 262 transitions. [2022-02-20 23:37:12,627 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 262 transitions. [2022-02-20 23:37:12,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:12,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:12,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:12,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 218 states, 170 states have (on average 1.5235294117647058) internal successors, (259), 217 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:12,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 259 transitions. [2022-02-20 23:37:12,630 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 259 transitions. Word has length 15 [2022-02-20 23:37:12,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:12,630 INFO L470 AbstractCegarLoop]: Abstraction has 218 states and 259 transitions. [2022-02-20 23:37:12,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 1.875) 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:37:12,631 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 259 transitions. [2022-02-20 23:37:12,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:37:12,631 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:12,631 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:37:12,638 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:37:12,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:37:12,838 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr20ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:37:12,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:12,839 INFO L85 PathProgramCache]: Analyzing trace with hash -135560350, now seen corresponding path program 1 times [2022-02-20 23:37:12,839 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:12,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [609782615] [2022-02-20 23:37:12,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:12,839 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:12,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:12,841 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:37:12,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 23:37:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:12,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:37:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:12,924 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:12,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {8111#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(15bv32, 2bv32); {8111#true} is VALID [2022-02-20 23:37:12,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {8111#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem20#1, main_#t~short21#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:12,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {8119#(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: L998 {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:12,991 INFO L290 TraceCheckUtils]: 3: Hoare triple {8119#(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: L998-1 {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:12,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {8119#(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: L999 {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:12,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {8119#(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;main_~marked~0#1 := 0bv32; {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:12,992 INFO L290 TraceCheckUtils]: 6: Hoare triple {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} assume !!(0bv32 != main_#t~nondet2#1 || 0bv32 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:12,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ 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: L1009 {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:12,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:12,993 INFO L290 TraceCheckUtils]: 9: Hoare triple {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ 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: L1010 {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:12,993 INFO L290 TraceCheckUtils]: 10: Hoare triple {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} 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: L1010-1 {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:12,994 INFO L290 TraceCheckUtils]: 11: Hoare triple {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:12,994 INFO L290 TraceCheckUtils]: 12: Hoare triple {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} 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: L1011 {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:12,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} 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; {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:12,995 INFO L290 TraceCheckUtils]: 14: Hoare triple {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1012 {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:12,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} assume 0bv32 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~marked~0#1 := 1bv32; {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:12,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} assume 0bv32 != main_~marked~0#1; {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:12,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} SUMMARY for call write~intINTTYPE4(1bv32, main_~x~0#1.base, ~bvadd32(8bv32, main_~x~0#1.offset), 4bv32); srcloc: L1020 {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:12,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} assume !(0bv32 != main_#t~nondet2#1 || 0bv32 == main_~marked~0#1);havoc main_#t~nondet2#1; {8119#(not (= |ULTIMATE.start_main_~head~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:12,997 INFO L290 TraceCheckUtils]: 19: Hoare triple {8119#(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; {8174#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:12,998 INFO L290 TraceCheckUtils]: 20: Hoare triple {8174#(not (= |ULTIMATE.start_main_~x~0#1.base| (_ bv0 32)))} assume !(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {8112#false} is VALID [2022-02-20 23:37:12,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {8112#false} assume !false; {8112#false} is VALID [2022-02-20 23:37:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:37:12,998 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:12,998 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:12,998 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [609782615] [2022-02-20 23:37:12,998 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [609782615] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:12,998 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:12,999 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:37:12,999 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444235534] [2022-02-20 23:37:12,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:12,999 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:37:12,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:13,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:37:13,028 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:37:13,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:37:13,028 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:13,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:37:13,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:37:13,029 INFO L87 Difference]: Start difference. First operand 218 states and 259 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:37:13,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:13,728 INFO L93 Difference]: Finished difference Result 246 states and 268 transitions. [2022-02-20 23:37:13,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:37:13,728 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:37:13,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:13,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:37:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2022-02-20 23:37:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:37:13,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 249 transitions. [2022-02-20 23:37:13,733 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 249 transitions. [2022-02-20 23:37:13,944 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 249 edges. 249 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:13,947 INFO L225 Difference]: With dead ends: 246 [2022-02-20 23:37:13,947 INFO L226 Difference]: Without dead ends: 246 [2022-02-20 23:37:13,947 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 19 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:37:13,947 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 286 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:13,947 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [286 Valid, 193 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:37:13,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2022-02-20 23:37:13,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 216. [2022-02-20 23:37:13,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:13,950 INFO L82 GeneralOperation]: Start isEquivalent. First operand 246 states. Second operand has 216 states, 169 states have (on average 1.5088757396449703) internal successors, (255), 215 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:13,950 INFO L74 IsIncluded]: Start isIncluded. First operand 246 states. Second operand has 216 states, 169 states have (on average 1.5088757396449703) internal successors, (255), 215 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:13,950 INFO L87 Difference]: Start difference. First operand 246 states. Second operand has 216 states, 169 states have (on average 1.5088757396449703) internal successors, (255), 215 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:13,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:13,956 INFO L93 Difference]: Finished difference Result 246 states and 268 transitions. [2022-02-20 23:37:13,956 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 268 transitions. [2022-02-20 23:37:13,956 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:13,956 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:13,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 216 states, 169 states have (on average 1.5088757396449703) internal successors, (255), 215 states have internal predecessors, (255), 0 states have call successors, (0), 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 246 states. [2022-02-20 23:37:13,957 INFO L87 Difference]: Start difference. First operand has 216 states, 169 states have (on average 1.5088757396449703) internal successors, (255), 215 states have internal predecessors, (255), 0 states have call successors, (0), 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 246 states. [2022-02-20 23:37:13,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:13,960 INFO L93 Difference]: Finished difference Result 246 states and 268 transitions. [2022-02-20 23:37:13,960 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 268 transitions. [2022-02-20 23:37:13,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:13,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:13,961 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:13,961 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:13,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 169 states have (on average 1.5088757396449703) internal successors, (255), 215 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:13,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 255 transitions. [2022-02-20 23:37:13,964 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 255 transitions. Word has length 22 [2022-02-20 23:37:13,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:13,964 INFO L470 AbstractCegarLoop]: Abstraction has 216 states and 255 transitions. [2022-02-20 23:37:13,964 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 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:37:13,964 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 255 transitions. [2022-02-20 23:37:13,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:37:13,965 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:13,965 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:13,972 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-02-20 23:37:14,172 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:37:14,172 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:37:14,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:14,172 INFO L85 PathProgramCache]: Analyzing trace with hash -696597241, now seen corresponding path program 1 times [2022-02-20 23:37:14,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:14,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1219428309] [2022-02-20 23:37:14,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:14,173 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:14,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:14,174 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:37:14,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:37:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:14,318 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 23:37:14,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:14,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:14,342 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:37:14,395 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:37:14,398 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 24 [2022-02-20 23:37:14,434 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:37:14,509 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:37:14,509 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:37:14,533 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 25 treesize of output 13 [2022-02-20 23:37:14,762 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-02-20 23:37:14,762 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2022-02-20 23:37:14,900 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:37:15,198 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:37:15,198 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-02-20 23:37:15,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 17 [2022-02-20 23:37:15,635 INFO L290 TraceCheckUtils]: 0: Hoare triple {9136#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(15bv32, 2bv32); {9136#true} is VALID [2022-02-20 23:37:15,638 INFO L290 TraceCheckUtils]: 1: Hoare triple {9136#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem20#1, main_#t~short21#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {9144#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:15,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {9144#(= (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: L998 {9144#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:15,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {9144#(= (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: L998-1 {9144#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:15,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {9144#(= (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: L999 {9144#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:15,640 INFO L290 TraceCheckUtils]: 5: Hoare triple {9144#(= (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;main_~marked~0#1 := 0bv32; {9157#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:15,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {9157#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} assume !!(0bv32 != main_#t~nondet2#1 || 0bv32 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {9161#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1)) (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:37:15,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {9161#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1)) (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: L1009 {9165#(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|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:37:15,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {9165#(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|)) (_ 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; {9165#(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|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:37:15,644 INFO L290 TraceCheckUtils]: 9: Hoare triple {9165#(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|)) (_ 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: L1010 {9172#(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|)) (_ 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:37:15,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {9172#(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|)) (_ 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: L1010-1 {9165#(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|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:37:15,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {9165#(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|)) (_ 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; {9165#(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|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:37:15,649 INFO L290 TraceCheckUtils]: 12: Hoare triple {9165#(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|)) (_ 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: L1011 {9182#(and (exists ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))) (= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:37:15,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {9182#(and (exists ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))) (= (select |#valid| |ULTIMATE.start_main_#t~mem5#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; {9186#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|) (_ bv1 1))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:37:15,659 INFO L290 TraceCheckUtils]: 14: Hoare triple {9186#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|) (_ bv1 1))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1012 {9186#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|) (_ bv1 1))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:37:15,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {9186#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|) (_ bv1 1))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} assume 0bv32 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~marked~0#1 := 1bv32; {9186#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|) (_ bv1 1))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:37:15,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {9186#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|) (_ bv1 1))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} assume 0bv32 != main_~marked~0#1; {9186#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|) (_ bv1 1))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:37:15,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {9186#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|) (_ bv1 1))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} SUMMARY for call write~intINTTYPE4(1bv32, main_~x~0#1.base, ~bvadd32(8bv32, main_~x~0#1.offset), 4bv32); srcloc: L1020 {9186#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|) (_ bv1 1))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:37:15,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {9186#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|) (_ bv1 1))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} assume !!(0bv32 != main_#t~nondet2#1 || 0bv32 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {9202#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1)) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|)) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (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:37:15,667 INFO L290 TraceCheckUtils]: 19: Hoare triple {9202#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1)) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|)) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_#t~malloc3#1.base|)))) (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: L1009 {9206#(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|)) (_ bv1 1)) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|)) (_ bv1 1))))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:37:15,668 INFO L290 TraceCheckUtils]: 20: Hoare triple {9206#(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|)) (_ bv1 1)) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|)) (_ 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; {9206#(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|)) (_ bv1 1)) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|)) (_ bv1 1))))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:37:15,668 INFO L290 TraceCheckUtils]: 21: Hoare triple {9206#(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|)) (_ bv1 1)) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|)) (_ 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: L1010 {9213#(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|)) (_ bv1 1)) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|)) (_ 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:37:15,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {9213#(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|)) (_ bv1 1)) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|)) (_ 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: L1010-1 {9206#(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|)) (_ bv1 1)) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|)) (_ bv1 1))))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:37:15,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {9206#(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|)) (_ bv1 1)) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|)) (_ 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; {9206#(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|)) (_ bv1 1)) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|)) (_ bv1 1))))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:37:15,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {9206#(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|)) (_ bv1 1)) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|)) (_ 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: L1011 {9223#(and (= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv1 1)) (exists ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_#t~mem5#1.base|)) (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|)) (_ bv1 1))) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))))} is VALID [2022-02-20 23:37:15,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {9223#(and (= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv1 1)) (exists ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_#t~mem5#1.base|)) (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|)) (_ bv1 1))) (= (_ 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; {9227#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_98| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_98|) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~x~0#1.base_98| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|)) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |v_ULTIMATE.start_main_~x~0#1.base_98|)))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:37:15,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {9227#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_97| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_98| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_98|) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~x~0#1.base_98| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_97|)) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~x~0#1.base_97| |v_ULTIMATE.start_main_~x~0#1.base_98|)))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} assume !(1bv1 == #valid[main_~x~0#1.base]); {9137#false} is VALID [2022-02-20 23:37:15,675 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:15,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:15,675 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:15,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1219428309] [2022-02-20 23:37:15,675 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1219428309] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:15,675 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:15,675 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 23:37:15,675 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637446720] [2022-02-20 23:37:15,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:15,676 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-02-20 23:37:15,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:15,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:15,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:15,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:37:15,710 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:15,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:37:15,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:37:15,710 INFO L87 Difference]: Start difference. First operand 216 states and 255 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:17,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:17,789 INFO L93 Difference]: Finished difference Result 239 states and 281 transitions. [2022-02-20 23:37:17,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:37:17,789 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-02-20 23:37:17,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 185 transitions. [2022-02-20 23:37:17,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:17,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 185 transitions. [2022-02-20 23:37:17,792 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 185 transitions. [2022-02-20 23:37:17,937 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:17,939 INFO L225 Difference]: With dead ends: 239 [2022-02-20 23:37:17,939 INFO L226 Difference]: Without dead ends: 239 [2022-02-20 23:37:17,940 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=107, Invalid=313, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:37:17,940 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 116 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 326 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:17,940 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 631 Invalid, 713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 373 Invalid, 0 Unknown, 326 Unchecked, 0.6s Time] [2022-02-20 23:37:17,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-02-20 23:37:17,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 229. [2022-02-20 23:37:17,943 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:17,943 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 229 states, 182 states have (on average 1.4945054945054945) internal successors, (272), 228 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:17,944 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 229 states, 182 states have (on average 1.4945054945054945) internal successors, (272), 228 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:17,944 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 229 states, 182 states have (on average 1.4945054945054945) internal successors, (272), 228 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:17,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:17,963 INFO L93 Difference]: Finished difference Result 239 states and 281 transitions. [2022-02-20 23:37:17,963 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 281 transitions. [2022-02-20 23:37:17,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:17,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:17,964 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 182 states have (on average 1.4945054945054945) internal successors, (272), 228 states have internal predecessors, (272), 0 states have call successors, (0), 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 239 states. [2022-02-20 23:37:17,964 INFO L87 Difference]: Start difference. First operand has 229 states, 182 states have (on average 1.4945054945054945) internal successors, (272), 228 states have internal predecessors, (272), 0 states have call successors, (0), 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 239 states. [2022-02-20 23:37:17,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:17,968 INFO L93 Difference]: Finished difference Result 239 states and 281 transitions. [2022-02-20 23:37:17,968 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 281 transitions. [2022-02-20 23:37:17,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:17,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:17,968 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:17,968 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:17,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 182 states have (on average 1.4945054945054945) internal successors, (272), 228 states have internal predecessors, (272), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:17,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 272 transitions. [2022-02-20 23:37:17,976 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 272 transitions. Word has length 27 [2022-02-20 23:37:17,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:17,978 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 272 transitions. [2022-02-20 23:37:17,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:17,978 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 272 transitions. [2022-02-20 23:37:17,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:37:17,979 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:17,979 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:17,989 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-02-20 23:37:18,179 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:37:18,180 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:37:18,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:18,180 INFO L85 PathProgramCache]: Analyzing trace with hash -2073986969, now seen corresponding path program 1 times [2022-02-20 23:37:18,180 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:18,180 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629242494] [2022-02-20 23:37:18,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:18,180 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:18,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:18,181 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:37:18,183 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 23:37:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:18,268 INFO L263 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:37:18,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:18,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:18,325 INFO L290 TraceCheckUtils]: 0: Hoare triple {10190#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(15bv32, 2bv32); {10190#true} is VALID [2022-02-20 23:37:18,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {10190#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem20#1, main_#t~short21#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {10190#true} is VALID [2022-02-20 23:37:18,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {10190#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, main_~head~0#1.offset, 4bv32); srcloc: L998 {10190#true} is VALID [2022-02-20 23:37:18,326 INFO L290 TraceCheckUtils]: 3: Hoare triple {10190#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~head~0#1.base, ~bvadd32(4bv32, main_~head~0#1.offset), 4bv32); srcloc: L998-1 {10190#true} is VALID [2022-02-20 23:37:18,326 INFO L290 TraceCheckUtils]: 4: Hoare triple {10190#true} SUMMARY for call write~intINTTYPE4(0bv32, main_~head~0#1.base, ~bvadd32(8bv32, main_~head~0#1.offset), 4bv32); srcloc: L999 {10190#true} is VALID [2022-02-20 23:37:18,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {10190#true} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset;main_~marked~0#1 := 0bv32; {10190#true} is VALID [2022-02-20 23:37:18,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {10190#true} assume !!(0bv32 != main_#t~nondet2#1 || 0bv32 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {10190#true} is VALID [2022-02-20 23:37:18,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {10190#true} 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: L1009 {10190#true} is VALID [2022-02-20 23:37:18,326 INFO L290 TraceCheckUtils]: 8: Hoare triple {10190#true} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {10190#true} is VALID [2022-02-20 23:37:18,326 INFO L290 TraceCheckUtils]: 9: Hoare triple {10190#true} 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: L1010 {10190#true} is VALID [2022-02-20 23:37:18,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {10190#true} 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: L1010-1 {10190#true} is VALID [2022-02-20 23:37:18,327 INFO L290 TraceCheckUtils]: 11: Hoare triple {10190#true} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {10190#true} is VALID [2022-02-20 23:37:18,327 INFO L290 TraceCheckUtils]: 12: Hoare triple {10190#true} 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: L1011 {10190#true} is VALID [2022-02-20 23:37:18,327 INFO L290 TraceCheckUtils]: 13: Hoare triple {10190#true} 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; {10190#true} is VALID [2022-02-20 23:37:18,327 INFO L290 TraceCheckUtils]: 14: Hoare triple {10190#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1012 {10190#true} is VALID [2022-02-20 23:37:18,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {10190#true} assume 0bv32 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~marked~0#1 := 1bv32; {10240#(= (_ bv1 32) |ULTIMATE.start_main_~marked~0#1|)} is VALID [2022-02-20 23:37:18,328 INFO L290 TraceCheckUtils]: 16: Hoare triple {10240#(= (_ bv1 32) |ULTIMATE.start_main_~marked~0#1|)} assume !(0bv32 != main_~marked~0#1); {10191#false} is VALID [2022-02-20 23:37:18,328 INFO L290 TraceCheckUtils]: 17: Hoare triple {10191#false} SUMMARY for call write~intINTTYPE4(0bv32, main_~x~0#1.base, ~bvadd32(8bv32, main_~x~0#1.offset), 4bv32); srcloc: L1022 {10191#false} is VALID [2022-02-20 23:37:18,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {10191#false} assume !!(0bv32 != main_#t~nondet2#1 || 0bv32 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {10191#false} is VALID [2022-02-20 23:37:18,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {10191#false} 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: L1009 {10191#false} is VALID [2022-02-20 23:37:18,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {10191#false} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {10191#false} is VALID [2022-02-20 23:37:18,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {10191#false} 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: L1010 {10191#false} is VALID [2022-02-20 23:37:18,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {10191#false} 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: L1010-1 {10191#false} is VALID [2022-02-20 23:37:18,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {10191#false} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {10191#false} is VALID [2022-02-20 23:37:18,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {10191#false} 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: L1011 {10191#false} is VALID [2022-02-20 23:37:18,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {10191#false} 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; {10191#false} is VALID [2022-02-20 23:37:18,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {10191#false} assume !(1bv1 == #valid[main_~x~0#1.base]); {10191#false} is VALID [2022-02-20 23:37:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:18,329 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:18,329 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:18,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629242494] [2022-02-20 23:37:18,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629242494] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:18,330 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:18,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:37:18,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852432900] [2022-02-20 23:37:18,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:18,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-02-20 23:37:18,330 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:18,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:18,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:18,355 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:37:18,356 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:18,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:37:18,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:37:18,356 INFO L87 Difference]: Start difference. First operand 229 states and 272 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:18,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:18,713 INFO L93 Difference]: Finished difference Result 256 states and 298 transitions. [2022-02-20 23:37:18,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:37:18,713 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-02-20 23:37:18,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:18,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:18,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2022-02-20 23:37:18,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2022-02-20 23:37:18,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 183 transitions. [2022-02-20 23:37:18,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:18,865 INFO L225 Difference]: With dead ends: 256 [2022-02-20 23:37:18,865 INFO L226 Difference]: Without dead ends: 256 [2022-02-20 23:37:18,865 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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:37:18,866 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 41 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:18,866 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 287 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:37:18,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-02-20 23:37:18,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 229. [2022-02-20 23:37:18,869 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:18,869 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 229 states, 182 states have (on average 1.4835164835164836) internal successors, (270), 228 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:18,869 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 229 states, 182 states have (on average 1.4835164835164836) internal successors, (270), 228 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:18,869 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 229 states, 182 states have (on average 1.4835164835164836) internal successors, (270), 228 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:18,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:18,873 INFO L93 Difference]: Finished difference Result 256 states and 298 transitions. [2022-02-20 23:37:18,873 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 298 transitions. [2022-02-20 23:37:18,873 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:18,873 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:18,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 182 states have (on average 1.4835164835164836) internal successors, (270), 228 states have internal predecessors, (270), 0 states have call successors, (0), 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 256 states. [2022-02-20 23:37:18,874 INFO L87 Difference]: Start difference. First operand has 229 states, 182 states have (on average 1.4835164835164836) internal successors, (270), 228 states have internal predecessors, (270), 0 states have call successors, (0), 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 256 states. [2022-02-20 23:37:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:18,877 INFO L93 Difference]: Finished difference Result 256 states and 298 transitions. [2022-02-20 23:37:18,877 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 298 transitions. [2022-02-20 23:37:18,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:18,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:18,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:18,878 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:18,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 182 states have (on average 1.4835164835164836) internal successors, (270), 228 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:18,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 270 transitions. [2022-02-20 23:37:18,881 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 270 transitions. Word has length 27 [2022-02-20 23:37:18,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:18,881 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 270 transitions. [2022-02-20 23:37:18,881 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:18,881 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 270 transitions. [2022-02-20 23:37:18,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:37:18,881 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:18,882 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:18,911 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-20 23:37:19,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:37:19,089 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:37:19,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:19,089 INFO L85 PathProgramCache]: Analyzing trace with hash -1815821531, now seen corresponding path program 1 times [2022-02-20 23:37:19,090 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:19,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76800777] [2022-02-20 23:37:19,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:19,090 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:19,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:19,101 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:37:19,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 23:37:19,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:19,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 23:37:19,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:19,282 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:19,299 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:37:19,334 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:37:19,334 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 24 [2022-02-20 23:37:19,366 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:37:19,428 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:37:19,429 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:37:19,465 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 25 treesize of output 13 [2022-02-20 23:37:19,692 INFO L356 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-02-20 23:37:19,693 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2022-02-20 23:37:19,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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:37:20,086 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:37:20,086 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-02-20 23:37:20,261 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 33 treesize of output 17 [2022-02-20 23:37:20,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {11270#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(15bv32, 2bv32); {11270#true} is VALID [2022-02-20 23:37:20,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {11270#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem20#1, main_#t~short21#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {11278#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:20,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {11278#(= (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: L998 {11278#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:20,533 INFO L290 TraceCheckUtils]: 3: Hoare triple {11278#(= (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: L998-1 {11278#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:20,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {11278#(= (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: L999 {11278#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:20,534 INFO L290 TraceCheckUtils]: 5: Hoare triple {11278#(= (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;main_~marked~0#1 := 0bv32; {11291#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:20,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {11291#(= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))} assume !!(0bv32 != main_#t~nondet2#1 || 0bv32 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {11295#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1)) (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:37:20,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {11295#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1)) (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: L1009 {11299#(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|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:37:20,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {11299#(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|)) (_ 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; {11299#(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|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:37:20,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {11299#(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|)) (_ 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: L1010 {11306#(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|)) (_ 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:37:20,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {11306#(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|)) (_ 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: L1010-1 {11299#(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|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:37:20,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {11299#(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|)) (_ 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; {11299#(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|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:37:20,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {11299#(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|)) (_ 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: L1011 {11316#(and (exists ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))) (= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:37:20,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {11316#(and (exists ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))))) (= (select |#valid| |ULTIMATE.start_main_#t~mem5#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; {11320#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (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|))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:37:20,543 INFO L290 TraceCheckUtils]: 14: Hoare triple {11320#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (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|))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1012 {11320#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (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|))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:37:20,543 INFO L290 TraceCheckUtils]: 15: Hoare triple {11320#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (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|))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} assume !(0bv32 != main_#t~nondet6#1);havoc main_#t~nondet6#1; {11320#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (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|))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:37:20,544 INFO L290 TraceCheckUtils]: 16: Hoare triple {11320#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (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|))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} assume !(0bv32 != main_~marked~0#1); {11320#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (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|))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:37:20,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {11320#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (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|))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} SUMMARY for call write~intINTTYPE4(0bv32, main_~x~0#1.base, ~bvadd32(8bv32, main_~x~0#1.offset), 4bv32); srcloc: L1022 {11320#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (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|))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:37:20,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {11320#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (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|))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} assume !!(0bv32 != main_#t~nondet2#1 || 0bv32 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {11336#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1)) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| |ULTIMATE.start_main_#t~malloc3#1.base|)) (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|))))) (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:37:20,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {11336#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1)) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| |ULTIMATE.start_main_#t~malloc3#1.base|)) (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|))))) (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: L1009 {11340#(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|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (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|))))))} is VALID [2022-02-20 23:37:20,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {11340#(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|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (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|))))))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {11340#(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|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (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|))))))} is VALID [2022-02-20 23:37:20,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {11340#(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|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (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|))))))} 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: L1010 {11347#(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|)) (_ 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))) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (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|))))))} is VALID [2022-02-20 23:37:20,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {11347#(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|)) (_ 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))) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (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|))))))} 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: L1010-1 {11340#(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|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (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|))))))} is VALID [2022-02-20 23:37:20,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {11340#(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|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (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|))))))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {11340#(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|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (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|))))))} is VALID [2022-02-20 23:37:20,555 INFO L290 TraceCheckUtils]: 24: Hoare triple {11340#(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|)) (_ bv1 1)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~x~0#1.base|) |ULTIMATE.start_main_~x~0#1.offset|))) (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|))))))} 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: L1011 {11357#(and (= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv1 1)) (exists ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| |ULTIMATE.start_main_#t~mem5#1.base|)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_99|))))))} is VALID [2022-02-20 23:37:20,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {11357#(and (= (select |#valid| |ULTIMATE.start_main_#t~mem5#1.base|) (_ bv1 1)) (exists ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_#t~mem5#1.base| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| |ULTIMATE.start_main_#t~mem5#1.base|)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| |ULTIMATE.start_main_~x~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_99|))))))} 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; {11361#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_100| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_~x~0#1.base_100|)) (= (_ bv0 1) (bvadd (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_100|) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| |v_ULTIMATE.start_main_~x~0#1.base_100|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_99|))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:37:20,556 INFO L290 TraceCheckUtils]: 26: Hoare triple {11361#(and (exists ((|v_ULTIMATE.start_main_~x~0#1.base_100| (_ BitVec 32)) (|v_ULTIMATE.start_main_~x~0#1.base_99| (_ BitVec 32))) (and (not (= |ULTIMATE.start_main_~x~0#1.base| |v_ULTIMATE.start_main_~x~0#1.base_100|)) (= (_ bv0 1) (bvadd (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_100|) (_ bv1 1))) (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| |ULTIMATE.start_main_~x~0#1.base|)) (not (= |v_ULTIMATE.start_main_~x~0#1.base_99| |v_ULTIMATE.start_main_~x~0#1.base_100|)) (= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_99|))))) (= (select |#valid| |ULTIMATE.start_main_~x~0#1.base|) (_ bv1 1)))} assume !(1bv1 == #valid[main_~x~0#1.base]); {11271#false} is VALID [2022-02-20 23:37:20,556 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:20,557 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:20,557 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:20,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76800777] [2022-02-20 23:37:20,557 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76800777] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:20,557 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:20,557 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-02-20 23:37:20,557 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111270907] [2022-02-20 23:37:20,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:20,557 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-02-20 23:37:20,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:20,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:20,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:20,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:37:20,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:20,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:37:20,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:37:20,593 INFO L87 Difference]: Start difference. First operand 229 states and 270 transitions. Second operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:22,668 INFO L93 Difference]: Finished difference Result 240 states and 279 transitions. [2022-02-20 23:37:22,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 23:37:22,669 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 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 27 [2022-02-20 23:37:22,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:22,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 181 transitions. [2022-02-20 23:37:22,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 181 transitions. [2022-02-20 23:37:22,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 181 transitions. [2022-02-20 23:37:22,835 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:37:22,837 INFO L225 Difference]: With dead ends: 240 [2022-02-20 23:37:22,837 INFO L226 Difference]: Without dead ends: 240 [2022-02-20 23:37:22,838 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=381, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:37:22,838 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 118 mSDsluCounter, 615 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 914 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 541 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:22,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 717 Invalid, 914 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 359 Invalid, 0 Unknown, 541 Unchecked, 0.6s Time] [2022-02-20 23:37:22,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-02-20 23:37:22,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 229. [2022-02-20 23:37:22,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:22,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 229 states, 182 states have (on average 1.478021978021978) internal successors, (269), 228 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,841 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 229 states, 182 states have (on average 1.478021978021978) internal successors, (269), 228 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,841 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 229 states, 182 states have (on average 1.478021978021978) internal successors, (269), 228 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:22,848 INFO L93 Difference]: Finished difference Result 240 states and 279 transitions. [2022-02-20 23:37:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 279 transitions. [2022-02-20 23:37:22,849 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:22,849 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:22,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 182 states have (on average 1.478021978021978) internal successors, (269), 228 states have internal predecessors, (269), 0 states have call successors, (0), 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 240 states. [2022-02-20 23:37:22,849 INFO L87 Difference]: Start difference. First operand has 229 states, 182 states have (on average 1.478021978021978) internal successors, (269), 228 states have internal predecessors, (269), 0 states have call successors, (0), 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 240 states. [2022-02-20 23:37:22,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:22,852 INFO L93 Difference]: Finished difference Result 240 states and 279 transitions. [2022-02-20 23:37:22,852 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 279 transitions. [2022-02-20 23:37:22,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:22,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:22,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:22,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:22,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 182 states have (on average 1.478021978021978) internal successors, (269), 228 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 269 transitions. [2022-02-20 23:37:22,856 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 269 transitions. Word has length 27 [2022-02-20 23:37:22,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:22,856 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 269 transitions. [2022-02-20 23:37:22,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.076923076923077) internal successors, (27), 14 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,857 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 269 transitions. [2022-02-20 23:37:22,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:37:22,857 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:22,857 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, 1, 1] [2022-02-20 23:37:22,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Ended with exit code 0 [2022-02-20 23:37:23,065 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:37:23,065 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 76 more)] === [2022-02-20 23:37:23,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:23,066 INFO L85 PathProgramCache]: Analyzing trace with hash -884267663, now seen corresponding path program 1 times [2022-02-20 23:37:23,066 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:23,066 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [374806637] [2022-02-20 23:37:23,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:23,066 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:23,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:23,067 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:37:23,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-20 23:37:23,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:23,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:37:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:23,202 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:23,208 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:37:23,264 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:37:23,265 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 24 [2022-02-20 23:37:23,315 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:37:23,417 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:37:23,417 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:37:23,529 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:37:23,530 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:37:23,604 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:37:23,604 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:37:23,742 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 25 treesize of output 13 [2022-02-20 23:37:23,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {12331#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(15bv32, 2bv32); {12331#true} is VALID [2022-02-20 23:37:23,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {12331#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~nondet6#1, main_#t~nondet2#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem9#1, main_#t~short10#1, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~nondet13#1, main_#t~malloc16#1.base, main_#t~malloc16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem22#1, main_#t~mem23#1, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem20#1, main_#t~short21#1, main_#t~mem25#1, main_#t~mem26#1, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_~head~0#1.base, main_~head~0#1.offset, main_~x~0#1.base, main_~x~0#1.offset, main_~marked~0#1, main_~tmp~0#1.base, main_~tmp~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; {12339#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:23,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {12339#(= (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: L998 {12339#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:23,791 INFO L290 TraceCheckUtils]: 3: Hoare triple {12339#(= (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: L998-1 {12339#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:23,791 INFO L290 TraceCheckUtils]: 4: Hoare triple {12339#(= (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: L999 {12339#(= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:23,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {12339#(= (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;main_~marked~0#1 := 0bv32; {12352#(and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|))} is VALID [2022-02-20 23:37:23,793 INFO L290 TraceCheckUtils]: 6: Hoare triple {12352#(and (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|))} assume !!(0bv32 != main_#t~nondet2#1 || 0bv32 == main_~marked~0#1);havoc main_#t~nondet2#1;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(12bv32); {12356#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1)) (not (= |ULTIMATE.start_main_~head~0#1.base| |ULTIMATE.start_main_#t~malloc3#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))))} is VALID [2022-02-20 23:37:23,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {12356#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc3#1.base|) (_ bv1 1)) (not (= |ULTIMATE.start_main_~head~0#1.base| |ULTIMATE.start_main_#t~malloc3#1.base|)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~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: L1009 {12360#(and (not (= |ULTIMATE.start_main_~head~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)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))))} is VALID [2022-02-20 23:37:23,795 INFO L290 TraceCheckUtils]: 8: Hoare triple {12360#(and (not (= |ULTIMATE.start_main_~head~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)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))))} havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset; {12360#(and (not (= |ULTIMATE.start_main_~head~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)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))))} is VALID [2022-02-20 23:37:23,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {12360#(and (not (= |ULTIMATE.start_main_~head~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)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~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: L1010 {12367#(and (not (= |ULTIMATE.start_main_~head~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)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (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|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))))} is VALID [2022-02-20 23:37:23,798 INFO L290 TraceCheckUtils]: 10: Hoare triple {12367#(and (not (= |ULTIMATE.start_main_~head~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)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= (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|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~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: L1010-1 {12360#(and (not (= |ULTIMATE.start_main_~head~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)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))))} is VALID [2022-02-20 23:37:23,798 INFO L290 TraceCheckUtils]: 11: Hoare triple {12360#(and (not (= |ULTIMATE.start_main_~head~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)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))))} havoc main_#t~mem4#1.base, main_#t~mem4#1.offset; {12360#(and (not (= |ULTIMATE.start_main_~head~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)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))))} is VALID [2022-02-20 23:37:23,799 INFO L290 TraceCheckUtils]: 12: Hoare triple {12360#(and (not (= |ULTIMATE.start_main_~head~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)) (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_~head~0#1.base|) (= |ULTIMATE.start_main_~x~0#1.offset| |ULTIMATE.start_main_~head~0#1.offset|) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~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: L1011 {12377#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))) (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_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)))} is VALID [2022-02-20 23:37:23,799 INFO L290 TraceCheckUtils]: 13: Hoare triple {12377#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))) (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_#t~mem5#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |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; {12381#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |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|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))) (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|)))} is VALID [2022-02-20 23:37:23,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {12381#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |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|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))) (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|)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1012 {12381#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |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|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))) (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|)))} is VALID [2022-02-20 23:37:23,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {12381#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |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|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))) (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|)))} assume 0bv32 != main_#t~nondet6#1;havoc main_#t~nondet6#1;main_~marked~0#1 := 1bv32; {12381#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |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|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))) (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|)))} is VALID [2022-02-20 23:37:23,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {12381#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |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|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))) (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|)))} assume 0bv32 != main_~marked~0#1; {12381#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |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|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))) (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|)))} is VALID [2022-02-20 23:37:23,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {12381#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= |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|)) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))) (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|)))} SUMMARY for call write~intINTTYPE4(1bv32, main_~x~0#1.base, ~bvadd32(8bv32, main_~x~0#1.offset), 4bv32); srcloc: L1020 {12394#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))) (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|)))} is VALID [2022-02-20 23:37:23,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {12394#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))) (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|)))} assume !(0bv32 != main_#t~nondet2#1 || 0bv32 == main_~marked~0#1);havoc main_#t~nondet2#1; {12394#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))) (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|)))} is VALID [2022-02-20 23:37:23,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {12394#(and (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~head~0#1.base|)) (_ bv1 1))) (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|)))} main_~x~0#1.base, main_~x~0#1.offset := main_~head~0#1.base, main_~head~0#1.offset; {12401#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~x~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (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)))} is VALID [2022-02-20 23:37:23,809 INFO L290 TraceCheckUtils]: 20: Hoare triple {12401#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~x~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (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)))} assume !!(0bv32 != main_~x~0#1.base || 0bv32 != main_~x~0#1.offset); {12401#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~x~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (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)))} is VALID [2022-02-20 23:37:23,809 INFO L290 TraceCheckUtils]: 21: Hoare triple {12401#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~x~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (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)))} goto; {12401#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~x~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (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)))} is VALID [2022-02-20 23:37:23,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {12401#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~x~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (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)))} main_~marked~0#1 := 0bv32; {12401#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~x~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (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)))} is VALID [2022-02-20 23:37:23,810 INFO L290 TraceCheckUtils]: 23: Hoare triple {12401#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~x~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (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)))} SUMMARY for call main_#t~mem7#1.base, main_#t~mem7#1.offset := read~$Pointer$(main_~x~0#1.base, main_~x~0#1.offset, 4bv32); srcloc: L1030-9 {12401#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~x~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (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)))} is VALID [2022-02-20 23:37:23,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {12401#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~x~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (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)))} main_#t~short10#1 := main_#t~mem7#1.base != 0bv32 || main_#t~mem7#1.offset != 0bv32; {12401#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~x~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (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)))} is VALID [2022-02-20 23:37:23,816 INFO L290 TraceCheckUtils]: 25: Hoare triple {12401#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~x~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (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)))} assume main_#t~short10#1; {12401#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~x~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (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)))} is VALID [2022-02-20 23:37:23,817 INFO L290 TraceCheckUtils]: 26: Hoare triple {12401#(and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~x~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (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)))} 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: L1030-3 {12423#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|)) (exists ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32))) (and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~x~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~mem8#1.base|)))))} is VALID [2022-02-20 23:37:23,817 INFO L290 TraceCheckUtils]: 27: Hoare triple {12423#(and (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_#t~mem8#1.base|)) (exists ((|ULTIMATE.start_main_~x~0#1.base| (_ BitVec 32))) (and (= (bvadd (bvneg (select |#valid| |ULTIMATE.start_main_~x~0#1.base|)) (_ bv1 1)) (_ bv0 1)) (not (= |ULTIMATE.start_main_~x~0#1.base| |ULTIMATE.start_main_#t~mem8#1.base|)))))} assume !(1bv1 == #valid[main_#t~mem8#1.base]); {12332#false} is VALID [2022-02-20 23:37:23,818 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:23,818 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:37:23,926 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-02-20 23:37:23,991 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_516) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-02-20 23:37:24,020 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_#t~mem4#1.base| v_ArrVal_514))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_516)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)) (_ bv1 1))) is different from false [2022-02-20 23:37:24,050 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_516 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_514 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv1 1) (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_514))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~x~0#1.base|) |c_ULTIMATE.start_main_~x~0#1.offset|) v_ArrVal_516)) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|)))) is different from false [2022-02-20 23:37:24,078 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:37:24,078 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:37:24,092 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:37:24,092 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 144 treesize of output 131 [2022-02-20 23:37:24,103 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:37:24,103 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 116 treesize of output 114 [2022-02-20 23:37:24,107 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 106 treesize of output 102